Search Results for ""

If a and n are relatively prime so that the greatest common divisor GCD(a,n)=1, then a^(lambda(n))=1 (mod n), where lambda is the Carmichael function.

The name for the set of integers modulo m, denoted Z/mZ. If m is a prime p, then the modulus is a finite field F_p=Z/pZ.

A star polygon-like figure {p/q} for which p and q are not relatively prime. Examples include the hexagram {6/2}, star of Lakshmi {8/2}, and nonagram {9/3}.

If p^k is the highest power of a prime p dividing the order of a finite group G, then a subgroup of G of order p^k is called a Sylow p-subgroup of G.

Diagonalize a form over the rationals to diag[p^a·A,p^b·B,...], where all the entries are integers and A, B, ... are relatively prime to p. Then Sylvester's signature is the ...

A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let rho be the number of graph edges at each node, rho^* the number of ...

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...

Consider a game where everyone in a classroom picks a number between 0 and 100. The person closest to half the average wins. Obviously, picking a number over 50 would be ...

Relationships between the number of singularities of plane algebraic curves. Given a plane curve, m = n(n-1)-2delta-3kappa (1) n = m(m-1)-2tau-3iota (2) iota = ...