Search Results for ""

A very large number defined in terms of circle notation by Steinhaus (1983) as .

The number 1. There are n nth roots of unity, known as the de Moivre numbers.

For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...

An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...

The plastic constant P, sometimes also called le nombre radiant, the minimal Pisot number, plastic number, plastic ratio, platin number, Siegel's number, or silver number, is ...

Every modular system has a modular system basis consisting of a finite number of polynomials. Stated another way, for every order n there exists a nonsingular curve with the ...

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

To define a recurring digital invariant of order k, compute the sum of the kth powers of the digits of a number n. If this number n^' is equal to the original number n, then ...

z^p-y^p=(z-y)(z-zetay)...(z-zeta^(p-1)y), where zeta=e^(2pii/p) (a de Moivre number) and p is a prime.

One of the Plücker characteristics, defined by p=1/2(n-1)(n-2)-(delta+kappa)=1/2(m-1)(m-2)-(tau+iota), where m is the class, n the order, delta the number of nodes, kappa the ...