Search Results for ""

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...

A function defined for all positive integers, sometimes also called an arithmetic function (Nagell 1951, p. 26) or number theoretic function (Wilf 1994, p. 58).

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...

The series producing Brun's constant converges even if there are an infinite number of twin primes, first proved by Brun (1919).

Given an arithmetic series {a_1,a_1+d,a_1+2d,...}, the number d is called the common difference associated to the sequence.

Given a geometric sequence {a_1,a_1r,a_1r^2,...}, the number r is called the common ratio associated to the sequence.

A sequence {a_1,a_2,a_3,...} fulfils a given property eventually if it fulfils it from some point onward, or, more precisely, if the property is fulfilled by the subsequence ...

The mathematical golden rule states that, for any fraction, both numerator and denominator may be multiplied by the same number without changing the fraction's value.

The greatest dividing exponent gde(n,b) of a base b with respect to a number n is the largest integer value of k such that b^k|n, where b^k<=n. It is implemented as the ...