Search Results for ""

The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...

For p an odd prime and a positive integer a which is not a multiple of p, a^((p-1)/2)=(a/p) (mod p), where (a|p) is the Legendre symbol.

The triangle of numbers A_(n,k) given by A_(n,1)=A_(n,n)=1 (1) and the recurrence relation A_(n+1,k)=kA_(n,k)+(n+2-k)A_(n,k-1) (2) for k in [2,n], where A_(n,k) are shifted ...

The exponential factorial is defined by the recurrence relation a_n=n^(a_(n-1)), (1) where a_0=1. The first few terms are therefore a_1 = 1 (2) a_2 = 2^1=2 (3) a_3 = ...

The Fibonacci factorial constant is the constant appearing in the asymptotic growth of the fibonorials (aka. Fibonacci factorials) n!_F. It is given by the infinite product ...

A field automorphism of a field F is a bijective map sigma:F->F that preserves all of F's algebraic properties, more precisely, it is an isomorphism. For example, complex ...

The two-dimensional Hammersley point set of order m is defined by taking all numbers in the range from 0 to 2^m-1 and interpreting them as binary fractions. Calling these ...

Let alpha_i and A_i be algebraic numbers such that the A_is differ from zero and the alpha_is differ from each other. Then the expression ...

For any two nonzero p-adic numbers a and b, the Hilbert symbol is defined as (a,b)={1 if z^2=ax^2+by^2 has a nonzero solution; -1 otherwise. (1) If the p-adic field is not ...

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