Search Results for ""

Given the Mertens function defined by M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function, Stieltjes claimed in an 1885 letter to Hermite that M(x)x^(-1/2) stays ...

Anomalous cancellation is a "canceling" of digits of a and b in the numerator and denominator of a fraction a/b which results in a fraction equal to the original. Note that ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

"Casting out nines" is an elementary check of a multiplication which makes use of the congruence 10^n=1 (mod 9). Let decimal numbers be written a=a_n...a_2a_1a_0, ...

Chebyshev noticed that the remainder upon dividing the primes by 4 gives 3 more often than 1, as plotted above in the left figure. Similarly, dividing the primes by 3 gives 2 ...

The first few terms of the continued fraction of the Copeland-Erdős constant are [0; 4, 4, 8, 16, 18, 5, 1, ...] (OEIS A030168), illustrated above. Interestingly, while the ...

Pairs of primes of the form (p, p+4) are called cousin primes. The first few are (3, 7), (7, 11), (13, 17), (19, 23), (37, 41), (43, 47), (67, 71), ... (OEIS A023200 and ...

Diophantus's riddle is a poem that encodes a mathematical problem. In verse, it read as follows: 'Here lies Diophantus,' the wonder behold. Through art algebraic, the stone ...

In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...

The term Euclidean refers to everything that can historically or logically be referred to Euclid's monumental treatise The Thirteen Books of the Elements, written around the ...