Search Results for ""

If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

Poker is a card game played with a normal deck of 52 cards. Sometimes, additional cards called "jokers" are also used. In straight or draw poker, each player is normally ...

A power series in a variable z is an infinite sum of the form sum_(i=0)^inftya_iz^i, where a_i are integers, real numbers, complex numbers, or any other quantities of a given ...

A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...

A random walk is a sequence of discrete steps in which each step is randomly taken subject to some set of restrictions in allowed directions and step lengths. Random walks ...

First published in Riemann's groundbreaking 1859 paper (Riemann 1859), the Riemann hypothesis is a deep mathematical conjecture which states that the nontrivial Riemann zeta ...

A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...

A sequence s_n(x) is called a Sheffer sequence iff its generating function has the form sum_(k=0)^infty(s_k(x))/(k!)t^k=A(t)e^(xB(t)), (1) where A(t) = A_0+A_1t+A_2t^2+... ...

A Smith number is a composite number the sum of whose digits is the sum of the digits of its prime factors (excluding 1). (The primes are excluded since they trivially ...