Search Results for ""

A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...

In simple algebra, multiplication is the process of calculating the result when a number a is taken b times. The result of a multiplication is called the product of a and b, ...

In a set X equipped with a binary operation · called a product, the multiplicative identity is an element e such that e·x=x·e=x for all x in X. It can be, for example, the ...

A d-repdigit is a number composed of repetition of a single digit (in a given base, generally taken as base 10 unless otherwise specified). For example, the beast number 666 ...

"Analysis of Variance." A statistical test for heterogeneity of means by analysis of group variances. ANOVA is implemented as ANOVA[data] in the Wolfram Language package ...

A simple polyhedron, also called a simplicial polyhedron, is a polyhedron that is topologically equivalent to a sphere (i.e., if it were inflated, it would produce a sphere) ...

Euclid's second theorem states that the number of primes is infinite. The proof of this can be accomplished using the numbers E_n = 1+product_(i=1)^(n)p_i (1) = 1+p_n#, (2) ...

A magic square is a square array of numbers consisting of the distinct positive integers 1, 2, ..., n^2 arranged such that the sum of the n numbers in any horizontal, ...

Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...

The nth central fibonomial coefficient is defined as [2n; n]_F = product_(k=1)^(n)(F_(n+k))/(F_k) (1) = ...