9 search results - page 1 / 2 » Distribution of generalized Fermat prime numbers |
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
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
ISPDC
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
MOC
2000
13 years 4 months ago
2000
Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a resul...
DSD
2007
IEEE
13 years 11 months ago
2007
IEEE
We present the architecture of digit-serial normal basis multiplier over GF(2m ). The multiplier was derived from the multiplier of Agnew et al. Proposed multiplier is scalable by...