Search Results for ""

A homework problem proposed in Steffi's math class in January 2003 asked students to prove that no ratio of two unequal numbers obtained by permuting all the digits 1, 2, ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...

A Calkin-Wilf tree is a special type of binary tree obtained by starting with the fraction 1/1 and iteratively adding a/(a+b) and (a+b)/b below each fraction a/b. The ...

Chebyshev-Gauss quadrature, also called Chebyshev quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function W(x)=(1-x^2)^(-1/2) (Abramowitz and ...

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...

A quartic nonhamiltonian graph is a quartic graph that is nonhamiltonian. A number of such graphs are illustrated above. Van Cleemput and Zamfirescu (2018) gave a 39-vertex ...

If there is an integer 0<x<p such that x^2=q (mod p), (1) i.e., the congruence (1) has a solution, then q is said to be a quadratic residue (mod p). Note that the trivial ...

When the Gaussian curvature K is everywhere negative, a surface is called anticlastic and is saddle-shaped. A surface on which K is everywhere positive is called synclastic. ...

An anyon is a projective representation of a Lie group.