TOPICS
Search

Search Results for ""


12631 - 12640 of 13135 for Book GraphSearch Results
Take any positive integer of two digits or more, reverse the digits, and add to the original number. This is the operation of the reverse-then-add sequence. Now repeat the ...
In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...
The Abel prize is a new mathematics prize of the Norwegian Academy of Science and Letters, dedicated to the memory of Niels Henrik Abel (1802-1829) on the occasion of the ...
An abundant number, sometimes also called an excessive number, is a positive integer n for which s(n)=sigma(n)-n>n, (1) where sigma(n) is the divisor function and s(n) is the ...
An additive cellular automaton is a cellular automaton whose rule is compatible with an addition of states. Typically, this addition is derived from modular arithmetic. ...
There are four varieties of Airy functions: Ai(z), Bi(z), Gi(z), and Hi(z). Of these, Ai(z) and Bi(z) are by far the most common, with Gi(z) and Hi(z) being encountered much ...
An alternating sign matrix is a matrix of 0s, 1s, and -1s in which the entries in each row or column sum to 1 and the nonzero entries in each row and column alternate in ...
Analytic continuation (sometimes called simply "continuation") provides a way of extending the domain over which a complex function is defined. The most common application is ...
Apéry's numbers are defined by A_n = sum_(k=0)^(n)(n; k)^2(n+k; k)^2 (1) = sum_(k=0)^(n)([(n+k)!]^2)/((k!)^4[(n-k)!]^2) (2) = _4F_3(-n,-n,n+1,n+1;1,1,1;1), (3) where (n; k) ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. B. Haible and T. Papanikolaou computed zeta(3) to 1000000 ...

...