Search Results for ""
401 - 410 of 2487 for Prime SumsSearch Results
The conjecture proposed by Catalan in 1888 and extended by E. Dickson that each aliquot sequence ends in a prime, a perfect number, or a set of sociable numbers. The ...
An algebraically soluble equation of odd prime degree which is irreducible in the natural field possesses either 1. Only a single real root, or 2. All real roots.
A function f(m) is called multiplicative if (m,m^')=1 (i.e., the statement that m and m^' are relatively prime) implies f(mm^')=f(m)f(m^') (Wilf 1994, p. 58). Examples of ...
The set of nilpotent elements in a commutative ring is an ideal, and it is called the nilradical. Another equivalent description is that it is the intersection of the prime ...
Any system of phi(n) integers, where phi(n) is the totient function, representing all the residue classes relatively prime to n is called a reduced residue system (Nagell ...
If n>1, (a,n)=1 (i.e., a and n are relatively prime), and m is the least integer >sqrt(n), then there exist an x and y such that ay=+/-x (mod n) where 0<x<m and 0<y<m (Nagell ...
Diagonalize a form over the rationals to diag[p^a·A,p^b·B,...], where all the entries are integers and A, B, ... are relatively prime to p. Then the p-signature of the form ...
Closed forms are known for the sums of reciprocals of even-indexed Lucas numbers P_L^((e)) = sum_(n=1)^(infty)1/(L_(2n)) (1) = sum_(n=1)^(infty)1/(phi^(2n)+phi^(-2n)) (2) = ...
The transformation of a sequence a_1, a_2, ... with a_n=sum_(d|n)b_d (1) into the sequence b_1, b_2, ... via the Möbius inversion formula, b_n=sum_(d|n)mu(n/d)a_d. (2) The ...
A recursive primality certificate for a prime p. The certificate consists of a list of 1. A point on an elliptic curve C y^2=x^3+g_2x+g_3 (mod p) for some numbers g_2 and ...
...
View search results from all Wolfram sites (13197 matches)

