Search Results for ""

The number of binary bits necessary to represent a number, given explicitly by BL(n) = 1+|_lgn_| (1) = [lg(n+1)], (2) where [x] is the ceiling function, |_x_| is the floor ...

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...

Use the definition of the q-series (a;q)_n=product_(j=0)^(n-1)(1-aq^j) (1) and define [N; M]=((q^(N-M+1);q)_M)/((q;q)_m). (2) Then P. Borwein has conjectured that (1) the ...

The function defined by the contour integral J_(n,k)(z) =1/(2pii)int^((0+))t^(-n-1)(t+1/t)^kexp[1/2z(t-1/t)]dt, where int_((0+)) denotes the contour encircling the point z=0 ...

The Brent-Salamin formula, also called the Gauss-Salamin formula or Salamin formula, is a formula that uses the arithmetic-geometric mean to compute pi. It has quadratic ...

A Brier number is a number that is both a Riesel number and a Sierpiński number of the second kind, i.e., a number n such that for all k>=1, the numbers n·2^k+1 and n·2^k-1 ...

Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...

Calabi's triangle is the unique triangle other that the equilateral triangle for which the largest inscribed square can be inscribed in three different ways (Calabi 1997). ...

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

Catalan's triangle is the number triangle 1 ; 1 1 ; 1 2 2 ; 1 3 5 5 ; 1 4 9 14 14 ; 1 5 14 28 42 42 ; 1 6 20 48 90 132 132 (1) (OEIS A009766) with entries given by ...