TOPICS
Search

Search Results for ""


571 - 580 of 634 for Diophantine Equation*th PowersSearch Results
A modulo multiplication group is a finite group M_m of residue classes prime to m under multiplication mod m. M_m is Abelian of group order phi(m), where phi(m) is the ...
A regular continued fraction is a simple continued fraction x = b_0+1/(b_1+1/(b_2+1/(b_3+...))) (1) = K_(k=1)^(infty)1/(b_k) (2) = [b_0;b_1,b_2,...], (3) where b_0 is an ...
The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...
An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...
A Keith number is an n-digit integer N>9 such that if a Fibonacci-like sequence (in which each term in the sequence is the sum of the n previous terms) is formed with the ...
A number is said to be simply normal to base b if its base-b expansion has each digit appearing with average frequency tending to b^(-1). A normal number is an irrational ...
The Alexander polynomial is a knot invariant discovered in 1923 by J. W. Alexander (Alexander 1928). The Alexander polynomial remained the only known knot polynomial until ...
There are two definitions of Bernoulli polynomials in use. The nth Bernoulli polynomial is denoted here by B_n(x) (Abramowitz and Stegun 1972), and the archaic form of the ...
A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensional spherical harmonics in angular ...
The Eulerian number <n; k> gives the number of permutations of {1,2,...,n} having k permutation ascents (Graham et al. 1994, p. 267). Note that a slightly different ...
1 ... 55|56|57|58|59|60|61 ... 64 Previous Next

...