Search Results for ""

The largest cube dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, ... (OEIS A008834).

A generalization of the Gaussian sum. For p and q of opposite parity (i.e., one is even and the other is odd), Schaar's identity states ...

The negative integers ..., -3, -2, -1.

The positive integers 1, 2, 3, ..., equivalent to N.

The nonnegative integers 0, 1, 2, ....

Following Yates (1980), a prime p such that 1/p is a repeating decimal with decimal period shared with no other prime is called a unique prime. For example, 3, 11, 37, and ...

The least positive integer m^* with the property that chi(y)=1 whenever y=1 (mod m^*) and (y,m)=1.

Landau (1911) proved that for any fixed x>1, sum_(0<|I[rho]|<=T)x^rho=-T/(2pi)Lambda(x)+O(lnT) as T->infty, where the sum runs over the nontrivial Riemann zeta function zeros ...

If a and n are relatively prime so that the greatest common divisor GCD(a,n)=1, then a^(lambda(n))=1 (mod n), where lambda is the Carmichael function.

One of the operations of addition, subtraction, multiplication, division, and integer (or rational) root extraction.