Search Results for ""

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

A number is squareful, also called nonsquarefree, if it contains at least one square in its prime factorization. The first few are 4, 8, 9, 12, 16, 18, 20, 24, 25, ... (OEIS ...

A Størmer number is a positive integer n for which the greatest prime factor p of n^2+1 is at least 2n. Every Gregory number t_x can be expressed uniquely as a sum of t_ns ...

A flexagon made with square faces. Gardner (1961) shows how to construct a tri-tetraflexagon, tetra-tetraflexagon, and hexa-tetraflexagon.

A trimagic cube is a magic cube that remains magic when all its numbers are both squared and cubed. Only two trimagic cubes are known. The first trimagic cube was found by C. ...

A figurate number which is constructed as an octahedral number with a square pyramid removed from each of the six graph vertices, TO_n = O_(3n-2)-6P_(n-1)^((4)) (1) = ...

A unit matrix is an integer matrix consisting of all 1s. The m×n unit matrix is often denoted J_(mn), or J_n if m=n. Square unit matrices J_n have determinant 0 for n>=2. An ...

A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...

A diamond-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...