TOPICS
Search

Search Results for ""


2581 - 2590 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
A figurate number which is constructed as a centered cube with a square pyramid appended to each face, RhoDod_n = CCub_n+6P_(n-1)^((4)) (1) = (2n-1)(2n^2-2n+1), (2) where ...
The nth Suzanne set S_n is defined as the set of composite numbers x for which n|S(x) and n|S_p(x), where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...
Let a_1=1 and define a_(n+1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This ...
1 calcus=1/(2304).
The first singular value k_1 of the elliptic integral of the first kind K(k), corresponding to K^'(k_1)=K(k_1), (1) is given by k_1 = 1/(sqrt(2)) (2) k_1^' = 1/(sqrt(2)). (3) ...
Given the generating functions defined by (1+53x+9x^2)/(1-82x-82x^2+x^3) = sum_(n=1)^(infty)a_nx^n (1) (2-26x-12x^2)/(1-82x-82x^2+x^3) = sum_(n=0)^(infty)b_nx^n (2) ...
Sarnak's constant is the constant C_(Sarnak) = product_(p>=3)(1-(p+2)/(p^3)) (1) = 0.7236484022... (2) (OEIS A065476), where the product is over the odd primes.
C_7 is the cyclic group that is the unique group of group order 7. Examples include the point group C_7 and the integers modulo 7 under addition (Z_7). No modulo ...
Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...
The recursive sequence defined by the recurrence relation a(n)=a(a(n-1))+a(n-a(n-1)) (1) with a(1)=a(2)=1. The first few values are 1, 1, 2, 2, 3, 4, 4, 4, 5, 6, ... (OEIS ...
1 ... 256|257|258|259|260|261|262 ... 937 Previous Next

...