|
|
 Up |
|
|
  |
Author: JSHJSH
Date: Jan 31, 2008 22:09
The joy is in the chase. I don't know what is in the heads of modern
math society but it is clear that there is some love of acceptance,
some desire for agreement, a wish to be seen as reaching a goal.
In contrast, I am the eternal rebel.
But what if I had to come down to earth? What if I got trapped by
success? What if I had to be mortal like you poor slobs dreaming that
you're free?
Give me the chase. I'll take that sorrow when the "proof" fades.
That guilt at having pushed the argument that is trash.
And wake up glad I'm not someone who cares, unlike you cows.
I kind of like cows because I can differentiate myself from you.
History is not about the man who agrees but the one who does not.
It's not defined by the vote in favor, but by breaking down the fights
against.
One man can stand against an entire world with just a single
mathematical proof.
But God help him if the damn cows ever get a clue that he's right. As
then he is truly lost.
Let them in their ignorance be cowed.
|
| Show full article (1.19Kb) |
|
| |
6 Comments |
|
|
Author: JSHJSH
Date: Jan 31, 2008 18:30
On Jan 31, 1:48 am, rossum coldmail.com> wrote:> On Wed, 30 Jan 2008 20:50:02 -0800 (PST), JSH gmail.com>
> wrote:
>>>Sorry I get a bit maudlin and over the top when I realize that there
>>was this simple thing that somehow escaped everyone including myself
>>for so long and part of me reacts very badly.
>
> It might be wise to wait an hour or two before posting what you have
> written. Write it off-line and save it. Go and do something else for
> a couple of hours. Then come back to it and check it over to see if
> there are any mistakes that need correcting or if you really should
> post it at all. That will avoid many of those "whoops!" posts where
> you have to correct errors in your previous posts.
>
> rossum
But why?
I'm not flabbergasted by the mistakes but by the success.
The chase is so consuming, but the finish is so...flat.
|
| Show full article (0.89Kb) |
|
| |
6 Comments |
|
|
Author: JessieJessie
Date: Jan 31, 2008 18:27
JSH behavior is now case study in PDF
http://www.derkeiler.com/pdf/Newsgroups/sci.crypt/2005-04/0674.pdf
==> is the following a real JSH post ??
Saturday, July 20, 1996
Last apologies. Last post here.
I realized just now just how seriously I abused the helpfulness and kindness
of people from this newsgroup and at colleges and universities around the
country, as well as AMS editors.
I'm posting this because I know that many of them may happen to see this.
I can't send email to them directly because I was forced to throw away all
of their addresses to stop from emailing. In a way I guess this post is just
more of the same silliness but oh well.
Having spent a lifetime learning high-pressure sales techniques: I was
brought up as a Jehovah's Witness (I'm no longer one) and having read books
on sales and psychology since I was about ten years old, I know all of the
tools and techniques (I still fall for them myself which might explain my
past, now permanently lapsed Amway distributorship).
|
| Show full article (1.83Kb) |
|
3 Comments |
|
|
Author: JSHJSH
Date: Jan 31, 2008 18:27
On Jan 31, 3:34 am, "Sebastian G." wrote:
> rossum wrote:
>> Can you tell us what proportion of matches lead to the trivial
>> factorisation please?
>
> I already gave you a figure: The rate of these failures is approximately
> 1-N/exp(N).
That doesn't sound right. With a target composite T with only two
prime factors about 50%% of the matches should be trivial
factorizations as there are only two. So that is a probability of
28.125%% success with just two primes. But you can just keep adding
primes.
What's interesting here is that the probabilities are just trivial
algebra following from the assumption that a given quadratic residue
for a particular prime will occur with about a 50%% rate.
James Harris
|
| |
|
no comments
|
|
|
Author: jiangwu.mailjiangwu.mail
Date: Jan 31, 2008 17:52
On Jan 30, 6:35 pm, Phil Carmody yahoo.co.uk>
wrote:> "jiangwu.m...@ gmail.com" gmail.com> writes:>> Hi,
>
>> Any one know such a random number generator:
>
>> Let p_1,...,p_n be n prime numbers. Let g=p_1p_2...p_n. Any number
>> 0<=x<=g can be represented as x_1,...,x_n, where x_i=x mod p_i.
>
>> The question is to generate a random number r in residue number
>> representation (r_1,...,r_n) and 0<= r <=b where b \approx sqrt(g). We
>> assume that a random bit generator is free.
>
>> It's straightforward to use the random bit generator to generate r
>> such that 0<=r<=b, and compute r_1=r mod p_1,.... , but it would take
>> O((log g)^2) time. I saw in a paper that r can be generated in residue
>> number representation and 0<=r<=b in O(log g) time using a proprietary
>> algorithm. Any one knows how it can be done?
> ...
|
| Show full article (1.18Kb) |
|
no comments
|
|
|
Author: Lionel Garth JonesLionel Garth Jones
Date: Jan 31, 2008 14:43
---------------------------------------
2008 USENIX/ACCURATE Electronic Voting Technology Workshop (EVT '08)
July 28-29, 2008
San Jose, CA, USA
Sponsored by USENIX: The Advanced Computing Systems Association, and
ACCURATE: A Center for Correct, Usable, Reliable, Auditable, and
Transparent Elections
Refereed paper submissions due: March 28, 2008, 11:59 p.m. PDT
Panel proposals due: May 2, 2008
http://www.usenix.org/evt08/cfpa
-----------------------------------------
The Call for Papers for the 2008 USENIX/ACCURATE Electronic Voting
Technology Workshop is now available.
|
| Show full article (2.85Kb) |
|
no comments
|
|
|
Author: Lits O'HateLits O'Hate
Date: Jan 31, 2008 13:42
On Jan 30, 11:01 pm, JSH gmail.com> wrote:> The probability that you have factors of T captured is just more
> trivial algebra.
>
> Or I'm wrong.
Are you taking bets?
> I talked
> about the result, and hey, I figured it out in steps as I'm just
> realizing myself today that there is this great way to finish it all!
How exactly do you plan to finish it all? Alcohol overdose?
> Who try to convince other people about how smart they are while they
> bully people online.
Who construct sentences with subjects and verbs.
> I'll talk about people who say they are "pure" as an excuse.
Well, you need all the excuses you can get.
> I'll suggest that maybe these people do nothing of value, which is why
> they hurl insults and accusations of insanity as they try to prevent
> the world from realizing the theft.
|
| Show full article (1.29Kb) |
|
1 Comment |
|
|
Author: RancerDSRancerDS
Date: Jan 31, 2008 09:09
Hobby encryption using OTP file(s) and custom application called
CypherND. Below is the content of an ASCII file used in the
substitution process....
----- Copy between the lines and save into notepad file with dot otp
extension -----
Kv0GTcB^qSd[n@F5(%%I>61oD#=z2
Xg}pl,skWu)h8UtP`/bZma*M
E3MXoBkIt[A`{_=j:z$?!UsJv5pg...
|
| Show full article (4.06Kb) |
|
no comments
|
|
|
Author: marcus_bmarcus_b
Date: Jan 31, 2008 08:31
On Jan 30, 10:01 pm, JSH gmail.com> wrote:> So what I did was just add one other congruence relationship to the
> traditional difference of squares:
>
> x^2 = y^2 mod N
>
> and
>
> z^2 = y^2 mod T
>
> where T is a composite to be factored coprime to N, and N is an odd
> integer.
>
> The mathematics is trivially easy but many of you have decided that
> there is one particular answer so you are not open to other solutions.
>
> The factoring congruences in their most general form that I
> discovered, where you have mod N, allow you to pick N as a prime and
> then pick it AGAIN as a composite that is the product of two of those
> primes and then compare. ...
|
| Show full article (3.14Kb) |
|
no comments
|
|
|
|
|
|
Author: Fredrico JuarrezFredrico Juarrez
Date: Jan 31, 2008 06:17
JSH wrote:
> Kind of sucks though. All the fun is in the chase.
Oh, I don't think so, Jimmy. I'm having loads of fun watching you
make a complete ass
of yourself, here in a newsgroup that will be archived for as long as
there is an Internet.
Are you not in the least concerned with the negative legacy that you
are bound
to leave behind for generations to come? Your progeny will have to
endure ridicule
and derision, and will be ashamed of being related to the person that
made such a
utter fool of himself in the 'early years' of the Internet.
|
| Show full article (1.10Kb) |
|
no comments
|
|
|
|
|
|
|
