Search Results for ""

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

A number of the form a_0+a_1zeta+...+a_(p-1)zeta^(p-1), where zeta=e^(2pii/p) is a de Moivre number and p is a prime number. Unique factorizations of cyclotomic integers fail ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

Let E be an elliptic curve defined over the field of rationals Q(sqrt(-d)) having equation y^2=x^3+ax+b with a and b integers. Let P be a point on E with integer coordinates ...

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

A p-adic integer is a p-adic number of the form sum_(k=m)^(infty)a_kp^k, where m>=0, a_k are integers, and p is prime. It is sufficient to take a_k in the set {0,1,...,p-1}. ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

An even perfect number is perfect number that is even, i.e., an even number n whose sum of divisors (including n itself) equals n. All known perfect numbers are even, and ...

An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...

A number of the form 2^n-1 obtained by setting x=1 in a Fermat-Lucas polynomial, more commonly known as a Mersenne number.