Search Results for ""

In his monumental treatise Disquisitiones Arithmeticae, Gauss conjectured that the class number h(-d) of an imaginary quadratic field with binary quadratic form discriminant ...

Let X be a set of urelements, and let V(X) be the superstructure with X as its set of individuals. Let kappa be a cardinal number. An enlargement V(^*X) is kappa-saturated ...

The unitary divisor function sigma_k^*(n) is the analog of the divisor function sigma_k(n) for unitary divisors and denotes the sum-of-kth-powers-of-the-unitary divisors ...

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...

The Goddard-Henning graph, illustrated above in several embeddings, is the 9-node planar graph of graph diameter 2 having domination number gamma=3. It was first constructed ...

The transformation S[{a_n}_(n=0)^N] of a sequence {a_n}_(n=0)^N into a sequence {b_n}_(n=0)^N by the formula b_n=sum_(k=0)^NS(n,k)a_k, (1) where S(n,k) is a Stirling number ...

Champernowne's constant C=0.12345678910111213... (1) (OEIS A033307) is the number obtained by concatenating the positive integers and interpreting them as decimal digits to ...

The factorization of a number into its constituent primes, also called prime decomposition. Given a positive integer n>=2, the prime factorization is written ...

A solution zeta_k=e^(2piik/d) to the cyclotomic equation x^d=1. The de Moivre numbers give the coordinates in the complex plane of the polygon vertices of a regular polygon ...

What is the maximum number of queens that can be placed on an n×n chessboard such that no two attack one another? The answer is n-1 queens for n=2 or n=3 and n queens ...