Search Results for ""

Consider a game where everyone in a classroom picks a number between 0 and 100. The person closest to half the average wins. Obviously, picking a number over 50 would be ...

The number (10^(666))!, where 666 is the beast number and n! denotes a factorial. The number has approximately 6.656×10^(668) decimal digits. The number of trailing zeros in ...

The sequence generated by the Levine-O'Sullivan greedy algorithm: 1, 2, 4, 6, 9, 12, 15, 18, 21, 24, 28, 32, 36, 40, 45, 50, 55, 60, 65, ... (OEIS A014011). The reciprocal ...

Levy (1963) noted that 13 = 3+(2×5) (1) 19 = 5+(2×7), (2) and from this observation, conjectured that all odd numbers >=7 are the sum of a prime plus twice a prime. This ...

A link invariant defined for a two-component oriented link as the sum of +1 crossings and -1 crossing over all crossings between the two links divided by 2. For components ...

The Littlewood conjecture states that for any two real numbers x,y in R, lim inf_(n->infty)n|nx-nint(nx)||ny-nint(ny)|=0 where nint(z) denotes the nearest integer function. ...

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...

The logarithmic capacity of a compact set E in the complex plane is given by gamma(E)=e^(-V(E)), (1) where V(E)=inf_(nu)int_(E×E)ln1/(|u-v|)dnu(u)dnu(v), (2) and nu runs over ...

A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...