Search Results for ""

Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...

A number n is called an Egyptian number if it is the sum of the denominators in some unit fraction representation of a positive whole number not consisting entirely of 1s. ...

The Euler-Mascheroni constant gamma, sometimes also called 'Euler's constant' or 'the Euler constant' (but not to be confused with the constant e=2.718281...) is defined as ...

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...

Consider the process of taking a number, multiplying its digits, then multiplying the digits of numbers derived from it, etc., until the remaining number has only one digit. ...

Define a carefree couple as a pair of positive integers (a,b) such that a and b are relatively prime (i.e., GCD(a,b)=1) and a is squarefree. Similarly, define a strongly ...

The nth cabtaxi number is the smallest positive number that can be written in n ways as a sum of two (not necessarily positive) cubes. The name derived from the taxicab ...

If r is an algebraic number of degree n, then the totality of all expressions that can be constructed from r by repeated additions, subtractions, multiplications, and ...

Start with an integer n, known as the digitaddition generator. Add the sum of the digitaddition generator's digits to obtain the digitaddition n^'. A number can have more ...