mersenneforum.org Prime Bear Animation
 Register FAQ Search Today's Posts Mark Forums Read

 2005-03-22, 00:08 #1 crash893     Sep 2002 23×37 Posts Prime Bear Animation
 2005-03-22, 05:22 #2 ewmayer ∂2ω=0     Sep 2002 República de California 22·31·79 Posts Is it my imagination, or does the bear seem to have problems getting out the "irregular" primes?
 2005-03-22, 06:42 #3 ixfd64 Bemusing Prompter     "Danny" Dec 2002 California 90716 Posts *raises WTF flag*
 2005-03-22, 15:22 #4 Primeinator     "Kyle" Feb 2005 Somewhere near M50..sshh! 2·3·149 Posts That's funny. How high does it go I wonder?
2005-03-22, 15:52   #5
Xyzzy

"Mike"
Aug 2002

1E2416 Posts

Quote:
 Originally Posted by Primeinator That's funny. How high does it go I wonder?
I let it run for several weeks once and it kept on crapping out primes...

 2005-03-22, 17:19 #6 rogue     "Mark" Apr 2003 Between here and the 595310 Posts You can look at the page source and see that it doesn't use a sieve. It just divided each odd number by all odd numbers <= the square root. If none divide, then it is prime. I assume it fails at 2^31.
 2005-03-23, 19:42 #7 patrik     "Patrik Johansson" Aug 2002 Uppsala, Sweden 23·53 Posts We need a Mersenne prime number bear. Not a likely candidate for the screen saver some newcomers ask for. Even if the unsuccesful numbers were displayed, it would be one every three weeks, at most. (What's the English word for that medical condition?)
2005-03-23, 20:03   #8
ewmayer
2ω=0

Sep 2002
República de California

22×31×79 Posts

Quote:
 Originally Posted by patrik We need a Mersenne prime number bear. Not a likely candidate for the screen saver some newcomers ask for. Even if the unsuccesful numbers were displayed, it would be one every three weeks, at most. (What's the English word for that medical condition?)
log-arrhythmia?

2005-03-24, 16:51   #9
Merlin

Jul 2003
Indianapolis

910 Posts

Quote:
 Originally Posted by rogue You can look at the page source and see that it doesn't use a sieve. It just divided each odd number by all odd numbers <= the square root. If none divide, then it is prime. I assume it fails at 2^31.
Too funny. In junior high school I wrote a BASIC program with that same algorithm and ran it on the mainframe at the state university in town using a teletype terminal in the computer lab. As in, output was on a roll of paper. Computers were -- different -- in the 1970's. I didn't let it run long enough to see when it failed - I think it got unBEARably slow long before it broke.

 Similar Threads Thread Thread Starter Forum Replies Last Post xilman Soap Box 699 2020-09-22 11:26 emily PrimeNet 3 2013-03-01 05:49 Sam Kennedy Programming 3 2012-12-16 08:38 Wacky Puzzles 80 2008-11-13 20:08 davieddy Soap Box 17 2007-12-14 07:39

All times are UTC. The time now is 05:28.

Sat Oct 31 05:28:48 UTC 2020 up 51 days, 2:39, 2 users, load averages: 1.09, 1.84, 1.87