Search Results for ""

An integer n which is tested to see if it divides a given number.

3 is the only integer which is the sum of the preceding positive integers (1+2=3) and the only number which is the sum of the factorials of the preceding positive integers ...

The triangle with edge lengths 3, 4, and 5 is the right triangle with smallest possible integer lengths and corresponds to the Pythagorean triple (3,4,5) where the legs have ...

An almost perfect number, also known as a least deficient or slightly defective (Singh 1997) number, is a positive integer n for which the divisor function satisfies ...

A number of the form 2^n that contains the digits 666 (i.e., the beast number) is called an apocalyptic number. 2^(157) is an apocalyptic number. The first few such powers ...

Also known as araneidan, this curve owes its name to its spider-like shape. It is given by the polar equation r=a(sin(ntheta))/(sin[(n-1)theta]), where a>0 and n>2 is an ...

The associated Legendre differential equation is a generalization of the Legendre differential equation given by d/(dx)[(1-x^2)(dy)/(dx)]+[l(l+1)-(m^2)/(1-x^2)]y=0, (1) which ...

An integer n is p-balanced for p a prime if, among all nonzero binomial coefficients (n; k) for k=0, ..., n (mod p), there are equal numbers of quadratic residues and ...

Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...

A Belphegor prime (also known as a Beelphegor prime) is a prime Belphegor number, i.e., a palindromic prime of the form 1(0...)666(0...)1. The first few Belphegor primes are ...