mersenneforum.org > Math Generalized Mersenne Primes
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2003-12-29, 11:18 #1 Cyclamen Persicum     Mar 2003 5116 Posts Generalized Mersenne Primes I need an information about nongenuine (generalized?) Mersenne numbers in terms of 2^a +/- 2^b +/- 2^c ... +/- 2^0, for instance, 2^384-2^128-2^96+2^32-1 is prime. I believe, they have all the advantages of regular mersenne numbers: 1) there is a fast deterministic Lucas-Lahmer-like test; 2) there is a way of simple modular reduction based on magic figure "nine" properties (I don't mean IBWDFFT here...) How can I perform the items 1 and 2 really? For example, how can I get a residue from division by 9909 in the decimal numeration? Sorry, I have forgotten completely, why are nongenuine mersenne numbers much better than regular mersenne numbers? Because there are a lot of them, contrary to 40-ty known regular ones.
 2004-01-30, 15:11 #2 Cyclamen Persicum     Mar 2003 34 Posts Crandall Numbers Besides holed generalized mersenne numbers such as 1111111111000001111111110000000000000000000000011111111111111... there are so called CRANDALL numbers 2^n-c, where c is small. Modular reduction is easy and worth nothing for these sweet honey numbers!!! But one thing has not been seen: is there deterministic LL-test for crandall primes or one must use common rabin-miller test?

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post sweety439 sweety439 41 2020-10-20 16:26 Bob Underwood Math 12 2020-10-11 20:01 carpetpool Information & Answers 9 2018-02-24 21:41 carpetpool Miscellaneous Math 1 2017-03-23 23:42 Unregistered Homework Help 6 2012-10-31 14:16

All times are UTC. The time now is 07:21.

Wed Oct 21 07:21:35 UTC 2020 up 41 days, 4:32, 0 users, load averages: 1.03, 1.31, 1.32

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.