Search Results for ""

The property of being the only possible solution (perhaps modulo a constant, class of transformation, etc.).

Number Theory

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

Let p>3 be a prime number, then 4(x^p-y^p)/(x-y)=R^2(x,y)-(-1)^((p-1)/2)pS^2(x,y), where R(x,y) and S(x,y) are homogeneous polynomials in x and y with integer coefficients. ...

Let n be a positive integer and r(n) the number of (not necessarily distinct) prime factors of n (with r(1)=0). Let O(m) be the number of positive integers <=m with an odd ...

A principal ideal domain is an integral domain in which every proper ideal can be generated by a single element. The term "principal ideal domain" is often abbreviated P.I.D. ...

SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...

A double Mersenne number is a number of the form M_(M_n)=2^(2^n-1)-1, where M_n is a Mersenne number. The first few double Mersenne numbers are 1, 7, 127, 32767, 2147483647, ...

A man of Seville is shaved by the Barber of Seville iff the man does not shave himself. Does the barber shave himself? This pseudoparadox was proposed by Bertrand Russell.

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).