Search Results for ""

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.

A type of diagram invented by Lewis Carroll (the name is an abbreviation of "Lewis") that can be used to determine the number of minimal covers of n numbers with k members.

The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...

A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...

The number 24 is equal to 4! (four factorial). A number puzzle asks to construct 24 in as many ways possible using elementary mathematical operations on three copies of the ...

A number b_(2n) having generating function sum_(n=0)^(infty)b_(2n)x^(2n) = 1/2ln((e^(x/2)-e^(-x/2))/(1/2x)) (1) = 1/2ln2+1/(48)x^2-1/(5760)x^4+1/(362880)x^6-.... (2) For n=1, ...

A number n is called k-hyperperfect if n = 1+ksum_(i)d_i (1) = 1+k[sigma(n)-n-1], (2) where sigma(n) is the divisor function and the summation is over the proper divisors ...

The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

Let p be an odd prime and b a positive integer not divisible by p. Then for each positive odd integer 2k-1<p, let r_k be r_k=(2k-1)b (mod p) with 0<r_k<p, and let t be the ...