Search Results for ""

If f(x) is a nonconstant integer polynomial and c is an integer such that f(c) is divisible by the prime p, that p is called a prime divisor of the polynomial f(x) (Nagell ...

If {a_0,a_1,...} is a recursive sequence, then the set of all k such that a_k=0 is the union of a finite (possibly empty) set and a finite number (possibly zero) of full ...

The second Mersenne prime M_3=2^3-1, which is itself the exponent of Mersenne prime M_7=2^7-1=127. It gives rise to the perfect number P_7=M_7·2^6=8128. It is a Gaussian ...

Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...

A Lehner continued fraction is a generalized continued fraction of the form b_0+(e_1)/(b_1+(e_2)/(b_2+(e_3)/(b_3+...))) where (b_i,e_(i+1))=(1,1) or (2, -1) for x in [1,2) an ...

A short set of data that proves the primality of a number. A certificate can, in general, be checked much more quickly than the time required to generate the certificate. ...

A Latin square is said to be odd if it contains an odd number of rows and columns that are odd permutations. Otherwise, it is said to be even. Let the number of even Latin ...

If an aliquot sequence {s^0(n),s(n),s^2(n),...} for a given n is bounded, it either ends at s(1)=0 or becomes periodic. If the sequence is periodic (or eventually periodic), ...

The boustrophedon ("ox-plowing") transform b of a sequence a is given by b_n = sum_(k=0)^(n)(n; k)a_kE_(n-k) (1) a_n = sum_(k=0)^(n)(-1)^(n-k)(n; k)b_kE_(n-k) (2) for n>=0, ...

A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...