Search Results for ""

The Diophantine equation sum_(j=1)^(m-1)j^n=m^n. Erdős conjectured that there is no solution to this equation other than the trivial solution 1^1+2^1=3^1, although this ...

The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...

The Jacobi symbol, written (n/m) or (n/m) is defined for positive odd m as (n/m)=(n/(p_1))^(a_1)(n/(p_2))^(a_2)...(n/(p_k))^(a_k), (1) where m=p_1^(a_1)p_2^(a_2)...p_k^(a_k) ...

Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is the ...

The Kummer graph is the name apparently first adopted here for the Levi graph of Kummer's 16_6 configuration (Coxeter 1950), corresponding to the folded 6-cube graph (Brouwer ...

A reduced root system is a root system R satisfying the additional property that, if alpha in R, then the only multiples of alpha in R are +/-alpha.

In April 1999, Ed Pegg conjectured on sci.math that there were only finitely many zerofree cubes, to which D. Hickerson responded with a counterexample. A few days later, Lew ...

The Dedekind psi-function is defined by the divisor product psi(n)=nproduct_(p|n)(1+1/p), (1) where the product is over the distinct prime factors of n, with the special case ...

A Saunders graphic is a plot of the dth base-b digits of a function f(x,y) as a function of x and y. The plots above show Saunders graphics for the functions ...

The antenna graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["AntennaGraph"].