Search Results for ""

Mills (1947) proved the existence of a real constant A such that |_A^(3^n)_| (1) is prime for all integers n>=1, where |_x_| is the floor function. Mills (1947) did not, ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

An additive function is an arithmetic function such that whenever positive integers a and b are relatively prime, f(ab)=f(a)+f(b). An example of an additive function is ...

A number of the form a_0+a_1zeta+...+a_(p-1)zeta^(p-1), where zeta=e^(2pii/p) is a de Moivre number and p is a prime number. Unique factorizations of cyclotomic integers fail ...

Call a projection of a link an almost alternating projection if one crossing change in the projection makes it an alternating projection. Then an almost alternating link is a ...

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 ...