Search Results for ""
571 - 580 of 1780 for Prime FactorSearch Results
The Skewes number (or first Skewes number) is the number Sk_1 above which pi(n)<li(n) must fail (assuming that the Riemann hypothesis is true), where pi(n) is the prime ...
Any composite number n with p|(n/p-1) for all prime divisors p of n. n is a Giuga number iff sum_(k=1)^(n-1)k^(phi(n))=-1 (mod n) (1) where phi is the totient function and ...
Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number ...
Solomon's seal knot is the prime (5,2)-torus knot 5_1 with braid word sigma_1^5. It is also known as the cinquefoil knot (a name derived from certain herbs and shrubs of the ...
The stevedore's knot is the 6-crossing prime knot 6_1. It is implemented in the Wolfram Language as KnotData["Stevedore"]. It has braid word ...
Consider the Lagrange interpolating polynomial f(x)=b_0+(x-1)(b_1+(x-2)(b_3+(x-3)+...)) (1) through the points (n,p_n), where p_n is the nth prime. For the first few points, ...
Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...
Take K a number field and m a divisor of K. A congruence subgroup H is defined as a subgroup of the group of all fractional ideals relative prime to m (I_K^m) that contains ...
For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...
For s>1, the Riemann zeta function is given by zeta(s) = sum_(n=1)^(infty)1/(n^s) (1) = product_(k=1)^(infty)1/(1-1/(p_k^s)), (2) where p_k is the kth prime. This is Euler's ...
...
View search results from all Wolfram sites (10835 matches)

