mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2005-10-10, 20:11   #1
bearnol
 
bearnol's Avatar
 
Sep 2005

127 Posts
Default New Prime Test allows reuse exps (eg GIMPS)?

Perform all calculations mod 2^n, suitable fixed n, (rather than mod p) allowing reuse exp:
Wanless' Theorem
http://www.bearnol.pwp.blueyonder.co...h/wanless.html
bearnol is offline   Reply With Quote
Old 2005-10-10, 20:22   #2
akruppa
 
akruppa's Avatar
 
"Nancy"
Aug 2002
Alexandria

46438 Posts
Default

This so goes in the Miscellaneous forum.

Alex
akruppa is offline   Reply With Quote
Old 2005-10-10, 20:42   #3
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
Repรบblica de California

34·5·29 Posts
Default

By one of our favorite Miscellaneous thread authors, no less.
ewmayer is offline   Reply With Quote
Old 2005-10-11, 04:55   #4
Orgasmic Troll
Cranksta Rap Ayatollah
 
Orgasmic Troll's Avatar
 
Jul 2003

641 Posts
Default

omg. Wanless? Hasn't this guy been cranking away in sci.math for YEARS? I thought the 999999.... thing looked familiar.

Man, he's right up there with JSH.
Orgasmic Troll is offline   Reply With Quote
Old 2005-10-11, 10:24   #5
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

24·719 Posts
Default

Quote:
Originally Posted by bearnol
Perform all calculations mod 2^n, suitable fixed n, (rather than mod p) allowing reuse exp:
Wanless' Theorem
http://www.bearnol.pwp.blueyonder.co...h/wanless.html
Hi James. Have you prepared your submission about non-Euclidean geometry yet?

Before anyone else spends too much time on this particular proposal, I would ask you to suggest a value for a suitable fixed n. Give us something to work on and we will likely make rather faster progress.



Paul
xilman is offline   Reply With Quote
Old 2005-10-11, 20:56   #6
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
Repรบblica de California

2DE116 Posts
Default

Quote:
Originally Posted by TravisT
omg. Wanless? Hasn't this guy been cranking away in sci.math for YEARS?
Apparently so - here's a Yahoo Groups message about JW's obsession with Miller-Rabin, which is also now well-documented in a thread on this forum:

http://groups.yahoo.com/group/primen.../message/15340

...and here's a typical crank thread in which the crank winds up talking to himself, and finding that he and himself are in perfect agreement, no less:

http://schools.mylounge.com/archive/...p/t-71818.html

Last fiddled with by ewmayer on 2005-10-11 at 21:03
ewmayer is offline   Reply With Quote
Old 2005-10-20, 12:55   #7
bearnol
 
bearnol's Avatar
 
Sep 2005

127 Posts
Default

Quote:
Originally Posted by bearnol
Perform all calculations mod 2^n, suitable fixed n, (rather than mod p) allowing reuse exp:
Wanless' Theorem
http://www.bearnol.pwp.blueyonder.co...h/wanless.html
Hmmm... I don't think there's much mileage in this one (since any odd number is called prime mod 2^n by this test alone). I probably should have written the program _before_ posting! Anyway thought I'd better let y'all know, just in the unlikely case anyone was still wasting time on it. Maybe the current method of finding Mersenne primes computationally _is_ the fastest... :-)
bearnol is offline   Reply With Quote
Old 2005-10-20, 13:21   #8
fatphil
 
fatphil's Avatar
 
May 2003

2·127 Posts
Default

Quote:
Originally Posted by akruppa
This so goes in the bin.

Alex
IFYPFY.

HTH, HAND,
Phil
fatphil is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Ok so now where can I test a huge prime besides gimps ONeil Information & Answers 33 2018-04-21 13:55
How do I test if it is a mersenne prime on GIMPS? spkarra Math 21 2015-01-23 18:13
Countdown to test all exps below M(20996011) - 13 petrw1 PrimeNet 3 2007-09-27 20:24
How to change versions during a test + Ecological cost of GIMPS Unregistered Software 5 2004-04-29 16:37
LL Test Rates and GIMPS Promotion Primenut Lounge 14 2003-06-09 09:32

All times are UTC. The time now is 04:36.


Thu Oct 6 04:36:16 UTC 2022 up 49 days, 2:04, 0 users, load averages: 1.14, 1.16, 1.19

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

โ‰  ยฑ โˆ“ รท ร— ยท โˆ’ โˆš โ€ฐ โŠ— โŠ• โŠ– โŠ˜ โŠ™ โ‰ค โ‰ฅ โ‰ฆ โ‰ง โ‰จ โ‰ฉ โ‰บ โ‰ป โ‰ผ โ‰ฝ โŠ โŠ โŠ‘ โŠ’ ยฒ ยณ ยฐ
โˆ  โˆŸ ยฐ โ‰… ~ โ€– โŸ‚ โซ›
โ‰ก โ‰œ โ‰ˆ โˆ โˆž โ‰ช โ‰ซ โŒŠโŒ‹ โŒˆโŒ‰ โˆ˜ โˆ โˆ โˆ‘ โˆง โˆจ โˆฉ โˆช โจ€ โŠ• โŠ— ๐–• ๐–– ๐–— โŠฒ โŠณ
โˆ… โˆ– โˆ โ†ฆ โ†ฃ โˆฉ โˆช โŠ† โŠ‚ โŠ„ โŠŠ โŠ‡ โŠƒ โŠ… โŠ‹ โŠ– โˆˆ โˆ‰ โˆ‹ โˆŒ โ„• โ„ค โ„š โ„ โ„‚ โ„ต โ„ถ โ„ท โ„ธ ๐“Ÿ
ยฌ โˆจ โˆง โŠ• โ†’ โ† โ‡’ โ‡ โ‡” โˆ€ โˆƒ โˆ„ โˆด โˆต โŠค โŠฅ โŠข โŠจ โซค โŠฃ โ€ฆ โ‹ฏ โ‹ฎ โ‹ฐ โ‹ฑ
โˆซ โˆฌ โˆญ โˆฎ โˆฏ โˆฐ โˆ‡ โˆ† ฮด โˆ‚ โ„ฑ โ„’ โ„“
๐›ข๐›ผ ๐›ฃ๐›ฝ ๐›ค๐›พ ๐›ฅ๐›ฟ ๐›ฆ๐œ€๐œ– ๐›ง๐œ ๐›จ๐œ‚ ๐›ฉ๐œƒ๐œ— ๐›ช๐œ„ ๐›ซ๐œ… ๐›ฌ๐œ† ๐›ญ๐œ‡ ๐›ฎ๐œˆ ๐›ฏ๐œ‰ ๐›ฐ๐œŠ ๐›ฑ๐œ‹ ๐›ฒ๐œŒ ๐›ด๐œŽ๐œ ๐›ต๐œ ๐›ถ๐œ ๐›ท๐œ™๐œ‘ ๐›ธ๐œ’ ๐›น๐œ“ ๐›บ๐œ”