CC
2010
Springer
13 years 8 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
MOC
1998
13 years 10 months ago
1998
We improve a criterion of Inkeri and show that if there is a solution to Catalan’s equation xp − yq = ±1,(1) with p and q prime numbers greater than 3 and both congruent to 3 ...
MOC
2002
13 years 10 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...
DM
2008
13 years 11 months ago
2008
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cycli...
CSL
2008
Springer
14 years 24 days ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
COCO
1999
Springer
14 years 3 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...