TOPICS
Search

Search Results for ""


371 - 380 of 587 for Modular ArithmeticSearch Results
A Calkin-Wilf tree is a special type of binary tree obtained by starting with the fraction 1/1 and iteratively adding a/(a+b) and (a+b)/b below each fraction a/b. The ...
"Casting out nines" is an elementary check of a multiplication which makes use of the congruence 10^n=1 (mod 9). Let decimal numbers be written a=a_n...a_2a_1a_0, ...
A Chen prime is a prime number p for which p+2 is either a prime or semiprime. Chen primes are named after Jing Run Chen who proved in 1966 that there are infinitely many ...
A cyclic number is an (n-1)-digit integer that, when multiplied by 1, 2, 3, ..., n-1, produces the same digits in a different order. Cyclic numbers are generated by the full ...
The base-12 number system composed of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B. Such a system has been advocated by no less than Herbert Spencer, John Quincy Adams, and ...
Pick any two relatively prime integers h and k, then the circle C(h,k) of radius 1/(2k^2) centered at (h/k,+/-1/(2k^2)) is known as a Ford circle. No matter what and how many ...
A rational number expressed in the form a/b (in-line notation) or a/b (traditional "display" notation), where a is called the numerator and b is called the denominator. When ...
The base 16 notational system for representing real numbers. The digits used to represent numbers using hexadecimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, ...
The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...
The lemniscate functions arise in rectifying the arc length of the lemniscate. The lemniscate functions were first studied by Jakob Bernoulli and Giulio Fagnano. A historical ...
1 ... 35|36|37|38|39|40|41 ... 59 Previous Next

...