![]() |
![]() |
#1 |
May 2004
31610 Posts |
![]()
For the above refer to "Minimum Universal Exponent Generalisation of
Fermat's Theorem" on site: www.crorepatibaniye.com/failurefunctions A.K. Devaraj (dkandadai@yahoo.com) |
![]() |
![]() |
![]() |
#2 |
Aug 2002
Buenos Aires, Argentina
101111111012 Posts |
![]()
In your web site you wrote:
What do you mean by minimum universal exponent? I suppose that by N you refer to N, the set of natural numbers. |
![]() |
![]() |
![]() |
#3 | |
May 2004
22×79 Posts |
![]() Quote:
5 is the minimum universal exponent (w.r.t base 2) i.e. (2^5) - 1 =31 and 5 is the minimum exp such that 2^n - 1 is congruent to zero (mod 31). Devaraj |
|
![]() |
![]() |
![]() |
#4 | |
May 2004
22×79 Posts |
![]() Quote:
31, a Mersenne Prime , for any x ending with 1 or 6. b) 127, another Mersene prime, is an impossible factor of this function i.e. it cannot be a factor of (2^x) + 29, no matter how large x is. Devaraj |
|
![]() |
![]() |
![]() |
#5 | |
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
![]() Quote:
(2^3) - 1 =7 and 3 is the minimum (positive) exponent such that 2^n - 1 is congruent to zero (mod 7). (2^2) - 1 =3 and 2 is the minimum (positive) exponent such that 2^n - 1 is congruent to zero (mod 3). |
|
![]() |
![]() |
![]() |
#6 | ||
Jun 2005
Near Beetlegeuse
22·97 Posts |
![]() Quote:
I think this is a consequence of the corollary he mentioned in his previous post Quote:
|
||
![]() |
![]() |
![]() |
#7 |
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
![]()
Okay. Thanks.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Modular restrictions on factors of Mersenne numbers | siegert81 | Math | 23 | 2014-03-18 11:50 |
Mersenne prime factors of very large numbers | devarajkandadai | Miscellaneous Math | 15 | 2012-05-29 13:18 |
newbie question - finding small factors of very large numbers | NeoGen | Math | 7 | 2007-03-13 00:04 |
Factors of Mersenne Numbers | asdf | Math | 17 | 2004-07-24 14:00 |
Factors of Mersenne numbers ? | Fusion_power | Math | 13 | 2003-10-28 20:52 |