Search Results for ""

The Cantor diagonal method, also called the Cantor diagonal argument or Cantor's diagonal slash, is a clever technique used by Georg Cantor to show that the integers and ...

There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...

Let J be a finite group and the image R(J) be a representation which is a homomorphism of J into a permutation group S(X), where S(X) is the group of all permutations of a ...

Given a subset A of a larger set, the characteristic function chi_A, sometimes also called the indicator function, is the function defined to be identically one on A, and is ...

Chebyshev noticed that the remainder upon dividing the primes by 4 gives 3 more often than 1, as plotted above in the left figure. Similarly, dividing the primes by 3 gives 2 ...

Given a unit circle, pick two points at random on its circumference, forming a chord. Without loss of generality, the first point can be taken as (1,0), and the second by ...

Select three points at random on the circumference of a unit circle and find the distribution of areas of the resulting triangles determined by these three points. The first ...

A prime number p is called circular if it remains prime after any cyclic permutation of its digits. An example in base-10 is 1,193 because 1,931, 9,311, and 3,119 are all ...

Let V be an n-dimensional linear space over a field K, and let Q be a quadratic form on V. A Clifford algebra is then defined over T(V)/I(Q), where T(V) is the tensor algebra ...

A colossally abundant number is a positive integer n for which there is a positive exponent epsilon such that (sigma(n))/(n^(1+epsilon))>=(sigma(k))/(k^(1+epsilon)) for all ...