80 search results - page 3 / 16 » moc 2002 |
MOC
2002
13 years 4 months ago
2002
Abstract. We describe a successful search for a sequence of fifteen consecutive integers, each the product of exactly four prime factors. Fifteen is best possible.
MOC
2002
13 years 4 months ago
2002
Numbers of the form Fb,n = b2n +1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of
MOC
2002
13 years 4 months ago
2002
Abstract. In the present paper we show how to speed up lattice parameter searches for Monte Carlo and quasi
MOC
2002
13 years 4 months ago
2002
We consider a bilinear reduced-strain finite element formulation for a shallow shell model of Reissner
MOC
2002
13 years 4 months ago
2002
We derive a conditional formula for the natural density E(q) of prime numbers p having its least prime primitive root equal to q, and compare theoretical results with the numerical...