Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

MOC
2002

favoriteEmaildiscussreport

109views more MOC 2002»

Distribution of generalized Fermat prime numbers

13 years 10 months ago

Distribution of generalized Fermat prime numbers

Download www.ams.org

Numbers of the form Fb,n = b2n +1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of

Harvey Dubner, Yves Gallot

Real-time Traffic

Computational Method | Fermat Numbers | MOC 2002 | Probable Primality |

claim paper

Related Content

» Evasiveness and the Distribution of Prime Numbers

» A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal

» Zeroes of Dirichlet Lfunctions and irregularities in the distribution of primes

» General DigitSerial Normal Basis Multiplier with Distributed Overlap

» Efficient storage scheme and query processing for supply chain management using RFID

» Randomization does not reduce the average delay in parallel packet switches

» Fully Adaptive Power Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System

» Branching Cells as Local States for Event Structures and Nets Probabilistic Applications

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	MOC
Authors	Harvey Dubner, Yves Gallot

Comments (0)