Search Results for ""

Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...

A pseudoperfect number for which none of its proper divisors are pseudoperfect (Guy 1994, p. 46). The first few are 6, 20, 28, 88, 104, 272, ... (OEIS A006036). Primitive ...

A primitive Pythagorean triple is a Pythagorean triple (a,b,c) such that GCD(a,b,c)=1, where GCD is the greatest common divisor. A right triangle whose side lengths give a ...

A primitive right triangle is a right triangle having integer sides a, b, and c such that GCD(a,b,c)=1, where GCD(a,b,c) is the greatest common divisor. The set of values ...

Prince Rupert's cube is the largest cube that can be made to pass through a given cube. In other words, the cube having a side length equal to the side length of the largest ...

Almost all processes that are not obviously simple can be viewed as computations of equivalent sophistication (Wolfram 2002, pp. 5 and 716-717). More specifically, the ...

A principle that was first enunciated by Jakob Bernoulli which states that if we are ignorant of the ways an event can occur (and therefore have no reason to believe that one ...

The truth of an infinite sequence of propositions P_i for i=1, ..., infty is established if (1) P_1 is true, and (2) P_k implies P_(k+1) for all k. This principle is ...

Typesetting "errors" in which exponents or multiplication signs are omitted but the resulting expression is equivalent to the original one. Examples include 2^59^2=2592 (1) ...

A polyhedron having two polygons in parallel planes as bases and triangular or trapezoidal lateral faces with one side lying in one base and the opposite polyhedron vertex or ...