A divisibility property of binomial coefficients viewed as an elementary sieve.
We show that log is needed to eliminate quantifiers in the theory of the real numbers with restricted analytic functions and exponentiation.
We introduce a family of deformations of the Riemann xi-function endowed with two continuous parameters. We show that it has rich analytic structure and that its conjectural (mild) zero-free region for some fixed parameter is a sufficient condition for the Riemann hypothesis to hold for the Riemann zeta function.
We present an algorithm that returns a proper factor of a polynomial over the -adic integers (if is reducible over ) or returns a power basis of the ring of integers of (if is irreducible over ). Our algorithm is based on the Round Four maximal order algorithm. Experimental results show that the new algorithm is considerably faster than the Round Four algorithm.