Mersenne: Another cash prize for Mersenne testing?
Whilst I was surfing I came across the word Mersenne, even though I didn't search for it. After I had finished laughing, I had to tell you people. The Hack Furby Challenge is a $250 prize offered by Peter van der Linden http://www.afu.com/fur.html for software to do something with a Furby. The original Hack Furby Challenge was won by Jeffrey Gibbons who supplied a Furby Upgrade Kit hardware, the new prize is for software. Peter van der Linden suggests You can program Furby to solve mathematical puzzles and equations, to look for Mersenne prime numbers, or simply to act as a speaking clock. The $74 upgrade, http://www.appspec.net/products/UpgradeKits/FurbyUpgrade/root.html replaces the original 6502 CPU with a 20MHz 8051 with 1MByte of serial Flash RAM and 1152 bytes of normally accessible RAM. Clearly this is not enough to Lucas-Lehmer test big Mersennes, but it is enough to Reverse Factor 3072 bit factors upto 3072 bit exponents given a prime as an input. As Reverse Factoring (without factoring P-1) is asymptotically more productive at completely factoring any of all 2^N-1 compared with LL testing just prime exponents this shouldn't be a problem given enough batteries and patience. I will post my analysis of Reverse Factoring shortly. Paul Landon _ Chat with friends online, try MSN Messenger: http://messenger.msn.com _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: operations allowed with values in the frequency domain
With a FFT, we get values va[0..n-1] and vb[0..n-1] in the frequency domain of 2 numbers A and B that we can add, substract or multiply. For example, let vc[i]=va[i]*vb[i] for i=0 to n-1, if we do an IFFT with the values vc[i], we get C=IFFT(vc[0..n-1])=A*B. Can we divide or compute remainders of values in the frequency domain ? For example, let vc[i]=va[i] / vb[i] for i=0 to n-1, would we get C=IFFT(vc[0..n-1])=A / B ? _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Another cash prize for Mersenne testing?
Now if we could get all the furbies linked together with the flashing eyes for RF we might have something.// LOL paul landon wrote: Whilst I was surfing I came across the word Mersenne, even though I didn't search for it. After I had finished laughing, I had to tell you people. The Hack Furby Challenge is a $250 prize offered by Peter van der Linden http://www.afu.com/fur.html for software to do something with a Furby. The original Hack Furby Challenge was won by Jeffrey Gibbons who supplied a Furby Upgrade Kit hardware, the new prize is for software. Peter van der Linden suggests You can program Furby to solve mathematical puzzles and equations, to look for Mersenne prime numbers, or simply to act as a speaking clock. The $74 upgrade, http://www.appspec.net/products/UpgradeKits/FurbyUpgrade/root.html replaces the original 6502 CPU with a 20MHz 8051 with 1MByte of serial Flash RAM and 1152 bytes of normally accessible RAM. Clearly this is not enough to Lucas-Lehmer test big Mersennes, but it is enough to Reverse Factor 3072 bit factors upto 3072 bit exponents given a prime as an input. As Reverse Factoring (without factoring P-1) is asymptotically more productive at completely factoring any of all 2^N-1 compared with LL testing just prime exponents this shouldn't be a problem given enough batteries and patience. I will post my analysis of Reverse Factoring shortly. Paul Landon _ Chat with friends online, try MSN Messenger: http://messenger.msn.com _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Another cash prize for Mersenne testing?
Now if we could get all the furbies linked to gether with the flashing eyes for RF we might have something.// LOL paul landon wrote: Whilst I was surfing I came across the word Mersenne, even though I didn't search for it. After I had finished laughing, I had to tell you people. The Hack Furby Challenge is a $250 prize offered by Peter van der Linden http://www.afu.com/fur.html for software to do something with a Furby. The original Hack Furby Challenge was won by Jeffrey Gibbons who supplied a Furby Upgrade Kit hardware, the new prize is for software. Peter van der Linden suggests You can program Furby to solve mathematical puzzles and equations, to look for Mersenne prime numbers, or simply to act as a speaking clock. The $74 upgrade, http://www.appspec.net/products/UpgradeKits/FurbyUpgrade/root.html replaces the original 6502 CPU with a 20MHz 8051 with 1MByte of serial Flash RAM and 1152 bytes of normally accessible RAM. Clearly this is not enough to Lucas-Lehmer test big Mersennes, but it is enough to Reverse Factor 3072 bit factors upto 3072 bit exponents given a prime as an input. As Reverse Factoring (without factoring P-1) is asymptotically more productive at completely factoring any of all 2^N-1 compared with LL testing just prime exponents this shouldn't be a problem given enough batteries and patience. I will post my analysis of Reverse Factoring shortly. Paul Landon _ Chat with friends online, try MSN Messenger: http://messenger.msn.com _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
