TOPICS
Search

Search Results for ""


1191 - 1200 of 2910 for Integer complexitySearch Results
A quantity which is either 0 (zero) or negative, i.e., <=0.
A positive even value of n for which phi(x)=n, where phi(x) is the totient function, has no solution. The first few are 14, 26, 34, 38, 50, ... (OEIS A005277).
In every residue class modulo p, there is exactly one integer polynomial with coefficients >=0 and <=p-1. This polynomial is called the normal polynomial modulo p in the ...
A constant appearing in formulas for the efficiency of the Euclidean algorithm, B = (12ln2)/(pi^2)[-1/2+6/(pi^2)zeta^'(2)]+C-1/2 (1) = 0.06535142... (2) (OEIS A143304), where ...
Place 2n balls in a bag and number them 1 to 2n, then pick half of them at random. The number of different possible sums for n=1, 2, 3, ... are then 2, 5, 10, 17, 26, ... ...
A number theoretic function is a function whose domain is the set of positive integers.
A polygonal number of the form O_n=n(3n-2). The first few are 1, 8, 21, 40, 65, 96, 133, 176, ... (OEIS A000567). The generating function for the octagonal numbers is ...
The paper folding constant is the constant given by P = sum_(k=0)^(infty)1/(2^(2^k))(1-1/(2^(2^(k+2))))^(-1) (1) = sum_(k=0)^(infty)(8^(2^k))/(2^(2^(k+2))-1) (2) = ...
y^m=kx^n(a-x)^b. The curves with integer n, b, and m were studied by de Sluze between 1657 and 1698. The name "Pearls of Sluze" was given to these curves by Blaise Pascal ...
The Pell constant is the infinite product P = 1-product_(k=0)^(infty)(1-1/(2^(2k+1))) (1) = 1-(1/2;1/4)_infty (2) = 0.58057755820489... (3) (OEIS A141848), where (a,q)_infty ...
1 ... 117|118|119|120|121|122|123 ... 291 Previous Next

...