Search Results for ""

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

A number x in which the first n decimal digits of the fractional part frac(x) sum to 666 is known as an evil number (Pegg and Lomont 2004). However, the term "evil" is also ...

The word net has several meanings in mathematics. It refers to a plane diagram in which the polyhedron edges of a polyhedron are shown, a point set satisfying certain ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...

An abundant number, sometimes also called an excessive number, is a positive integer n for which s(n)=sigma(n)-n>n, (1) where sigma(n) is the divisor function and s(n) is the ...

Archimedes' cattle problem, also called the bovinum problema, or Archimedes' reverse, is stated as follows: "The sun god had a herd of cattle consisting of bulls and cows, ...

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 ...

A finite group G has a finite number of conjugacy classes and a finite number of distinct irreducible representations. The group character of a group representation is ...

The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...