Search Results for ""

Marion's theorem (Mathematics Teacher 1993, Maushard 1994, Morgan 1994) states that the area of the central hexagonal region determined by trisection of each side of a ...

Consider the process of taking a number, multiplying its digits, then multiplying the digits of numbers derived from it, etc., until the remaining number has only one digit. ...

Dickson states "In a letter to Tanner [L'intermediaire des math., 2, 1895, 317] Lucas stated that Mersenne (1644, 1647) implied that a necessary and sufficient condition that ...

An obtuse triangle is a triangle in which one of the angles is an obtuse angle. (Obviously, only a single angle in a triangle can be obtuse or it wouldn't be a triangle.) A ...

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...

Pronic numbers are figurate numbers of the form P_n=2T_n=n(n+1), where T_n is the nth triangular number. The first few are 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, ... (OEIS ...

A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...

A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...

A sequence produced by the instructions "reverse, add to the original, then sort the digits." For example, after 668, the next iteration is given by 668+866=1534, so the next ...