Search Results for ""

A multiplicative number theoretic function is a number theoretic function f that has the property f(mn)=f(m)f(n) (1) for all pairs of relatively prime positive integers m and ...

The sum c_q(m)=sum_(h^*(q))e^(2piihm/q), (1) where h runs through the residues relatively prime to q, which is important in the representation of numbers by the sums of ...

A unique factorization domain, called UFD for short, is any integral domain in which every nonzero noninvertible element has a unique factorization, i.e., an essentially ...

Kloosterman's sum is defined by S(u,v,n)=sum_(h)exp[(2pii(uh+vh^_))/n], (1) where h runs through a complete set of residues relatively prime to n and h^_ is defined by hh^_=1 ...

Let omega(n) be the number of distinct prime factors of n. If Psi(x) tends steadily to infinity with x, then lnlnx-Psi(x)sqrt(lnlnx)<omega(n)<lnlnx+Psi(x)sqrt(lnlnx) for ...

The hypothesis that an integer n is prime iff it satisfies the condition that 2^n-2 is divisible by n. Dickson (2005, p. 91) stated that Leibniz believe to have proved that ...

A lucky number of Euler is a number p such that the prime-generating polynomial n^2-n+p is prime for n=1, 2, ..., p-1. Such numbers are related to the imaginary quadratic ...

Levy (1963) noted that 13 = 3+(2×5) (1) 19 = 5+(2×7), (2) and from this observation, conjectured that all odd numbers >=7 are the sum of a prime plus twice a prime. This ...

A Størmer number is a positive integer n for which the greatest prime factor p of n^2+1 is at least 2n. Every Gregory number t_x can be expressed uniquely as a sum of t_ns ...

A set S of positive integers is said to be Diophantine iff there exists a polynomial Q with integral coefficients in m>=1 indeterminates such that ...