Search Results for ""

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

Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...

Betti numbers are topological objects which were proved to be invariants by Poincaré, and used by him to extend the polyhedral formula to higher dimensional spaces. ...

A plot of the map winding number W resulting from mode locking as a function of Omega for the circle map theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n) (1) with K=1. (Since ...

Let F_n be the nth Fibonacci number. Then the sequence {F_n}_(n=2)^infty={1,2,3,5,8,...} is complete, even if one is restricted to subsequences in which no two consecutive ...

A number with a continued fraction whose terms are the values of one or more polynomials evaluated on consecutive integers and then interleaved. This property is preserved by ...

Let K be a number field with ring of integers R and let A be a nontrivial ideal of R. Then the ideal class of A, denoted [A], is the set of fractional ideals B such that ...