Search Results for ""

To divide is to perform the operation of division, i.e., to see how many times a divisor d goes into another number n. n divided by d is written n/d or n÷d. The result need ...

Taking the ratio x/y of two numbers x and y, also written x÷y. Here, x is called the dividend, y is called the divisor, and x/y is called a quotient. The symbol "/" is called ...

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

A conjecture due to Paul Erdős and E. G. Straus that the Diophantine equation 4/n=1/a+1/b+1/c involving Egyptian fractions always can be solved (Obláth 1950, Rosati 1954, ...

The number of bases in which 1/p is a repeating decimal (actually, repeating b-ary) of length l is the same as the number of fractions 0/(p-1), 1/(p-1), ..., (p-2)/(p-1) ...

Each of the sacred unit fractions which the ancient Egyptians attributed to the six parts of the eye of the god Horus: 1/2, 1/4, 1/8, 1/16, 1/32, and 1/64. These fractions, ...

For all n, there exists a k such that the kth term of the Goodstein sequence G_k(n)=0. In other words, every Goodstein sequence converges to 0. The secret underlying ...

The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

The sequence of numbers which are sums of distinct powers of 4. The first few are 0, 1, 4, 5, 16, 17, 20, 21, 64, 65, 68, 69, 80, 81, 84, ... (OEIS A000695). These numbers ...