Search Results for ""

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...

A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...

The trefoil knot 3_1, also called the threefoil knot or overhand knot, is the unique prime knot with three crossings. It is a (3, 2)-torus knot and has braid word sigma_1^3. ...

The truncated octahedron is the 14-faced Archimedean solid with faces 8{6}+6{4}. It is also the uniform polyhedron with Maeder index 8 (Maeder 1997), Wenninger index 7 ...

A q-series is series involving coefficients of the form (a;q)_n = product_(k=0)^(n-1)(1-aq^k) (1) = product_(k=0)^(infty)((1-aq^k))/((1-aq^(k+n))) (2) = ...

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, ...

Fermat's last theorem is a theorem first proposed by Fermat in the form of a note scribbled in the margin of his copy of the ancient Greek text Arithmetica by Diophantus. The ...

Primorial primes are primes of the form p_n#+/-1, where p_n# is the primorial of p_n. A coordinated search for such primes is being conducted on PrimeGrid. p_n#-1 is prime ...