Portal:Number theory/Selected picture

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Selected picture

Euclidean algorithm running time

Plot of the running time of the Euclidean algorithm for gcd(x,y). Red indicates a fast computation, while successively bluer points indicate slower computations.

...Archive Read more...

Selected picture

Rational approximations to regular octagons

Rational approximations to regular octagons, with coordinates derived from the Pell numbers.

...Archive Read more...

Selected picture

Clock group

Time-keeping on a clock gives an example of modular arithmetic, the "clock group" is represented by the group Z/12Z for a 12-hour clock and Z/24Z for a 24-hour clock.

...Archive Read more...

Selected picture

even number as the sum of two primes

Graph of the number of ways to write an even number n as the sum of two primes (4 ≤ n ≤ 1,000,000). This is the main object of study of the Goldbach's conjecture

...Archive Read more...

Selected picture