Search Results for ""

A semiprime which English economist and logician William Stanley Jevons incorrectly believed no one else would be able to factor. According to Jevons (1874, p. 123), "Can the ...

There are two distinct entities both known as the Lagrange number. The more common one arises in rational approximation theory (Conway and Guy 1996), while the other refers ...

In 1891, Chebyshev and Sylvester showed that for sufficiently large x, there exists at least one prime number p satisfying x<p<(1+alpha)x, where alpha=0.092.... Since the ...

A totative is a positive integer less than or equal to a number n which is also relatively prime to n, where 1 is counted as being relatively prime to all numbers. The number ...

A function defined for all positive integers, sometimes also called an arithmetic function (Nagell 1951, p. 26) or number theoretic function (Wilf 1994, p. 58).

For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

Carmichael's conjecture asserts that there are an infinite number of Carmichael numbers. This was proven by Alford et al. (1994).

The Gelfond-Schneider constant is sometimes known as the Hilbert number. Flannery and Flannery (2000, p. 35) define a Hilbert number as a positive integer of the form n=4k+1 ...

A proof that is only based on visual elements, without any comments. An arithmetic identity can be demonstrated by a picture showing a self-evident equality between numerical ...