code - you must stop

[HappyScrappy]

okay - the good part is that when you do a search for all posts by a user, they are ordered by time.

the bad part is - I have no contextual reference.

is it beale style?
packet reference?

 

[Nimrod25]

Has he really done that shit for all 900+ posts?

 

[Code]

Sorry man, I was dropping a prime schema to help you with the previous message...fermat for relative primes.

 

[Code]

They're about to become a bit more obvious....


5843

 

[HappyScrappy]

okay - stupid question - are you still in reference to the crypt one - I've been off the board all day and I don't know if you are still referring to that, or if you slipped another one in.

 

[HappyScrappy]

http://www.utm.edu/research/primes/lists/small/100000.txt

 

[Code]

Yeah, sorry I've been off until now too.
I'm referencing that one.

The scrypt.

 

[Code]

3221

 

[HappyScrappy]

Sorry man, I was dropping a prime schema to help you with the previous message...fermat for relative primes.

fermat, which leads to turing, who cracked the enigma - but there is another way around them as well... but the way I know around them - isn't primes, so I need to find the code book and look up an alternative in all honesty if that is what you are hinting towards (an alternative).

fermat's enigma, written by simon singh - who also wrote the code book - which I'm trying to find on my bookshelves now...

 

[~HOUNDOG~]

8301
Ya I'm real fucking cool posting numbers all day!

 

[Code]

Ever see that TV show, Connections Happy?

You and I think a lot alike. Since you're very freakin' close man!!!
Scarey!!!!

3119

 

[Code]

BTW, cool link Happy.
the first 1000 primes, very useful!!

 

[HappyScrappy]

Ever see that TV show, Connections Happy?

You and I think a lot alike. Since you're very freakin' close man!!!
Scarey!!!!

3119

connections is AWESOME - we had to watch nearly all of them in a History of Science class I took - which involved a lot of sleeping on my part.
I'm truly retarded with names so I forget the fellow that hosted it, but it was great.

and that link is the first 100K+ primes

 

[Fonz]

While we're at it, lets try to solve Fermats Last Theorem:

Xexp(N)= (X-1)exp(N)+(X-2)exp(N)

for N>2

try for a QED.

Hehe.........lets you try that one. Maybe in a couple of
centuries......LOL

Anyways, enough belittling. Did any of you guys see that
DAMN complicated mathematical algorithmical program
being developed to find MASSIVE prime numbers?

Thing defines the term complicated.

Fonz

 

[Code]

Yeah, problem with factoring those big ass primes is most folks have the wrong paradigm, they use RISC/CISC procs rather than ASICs.

So they end up throwing dozens of threaded farms at the task rather than throwing 5 or 6 ASICs with a limited [read proprietary] OS/UI.

A few places I worked at did use ASICs and we had a blast factoring primes and relative primes.

But the MASSIVE baby you're talking about does presently have the record for largest discovered prime.

 

[smallmovesal]

fermat's last theorem was already solved. no point.

nova had a big special on it that was cool. my dad is a math guy and we watched it together.

me - i'm dumb. but the story of it was interesting.

 

[Fonz]

fermat's last theorem was already solved. no point.

nova had a big special on it that was cool. my dad is a math guy and we watched it together.

me - i'm dumb. but the story of it was interesting.

Smalls, the guy who solved actualy made a mistake. His
eliptical-variable-interpretation was wrong in a certain
place. He then corrected it though after it was found.

It was 200 pages long.

However, fermat wrote on the right margin of his
F.L.T paradoxical statement:

"remarkable proof"


You have to remember this guy lived over 3 centuries ago,
and DID NOT possess our degree of mathematical knowledge
therefore THERE MUST exist a FAR simpler solution to the
problem that STILL evades everybody.

Fonz

 

[~HOUNDOG~]

sounds interesting.

 

[saint808]

well i'll give you props for the patience for cyptology.


Rich