• Aucun résultat trouvé

Episode 07 – Constructible polygons European section – Season 3

N/A
N/A
Protected

Academic year: 2022

Partager "Episode 07 – Constructible polygons European section – Season 3"

Copied!
8
0
0

Texte intégral

(1)

Episode 07 – Constructible polygons

European section – Season 3

Episode 07 – Constructible polygons

(2)

Euclid

Euclid was a Greek mathematician and is often referred to as the “Father of Geometry.” He was active in Hellenistic Alexandria during the reign of Ptolemy I (323-283 BC).

He knew how to inscribe a regular polygon with 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, 60, 64,. . . , sides.

Episode 07 – Constructible polygons

(3)

Gauss

Carl Friedrich Gauss proved the constructibility of the regular 17-gon in 1796. Five years later, he developed the theory of Gaussian periods in his

Disquisitiones Arithmeticae. This theory allowed him to formulate a sufficient condition for the

constructibility of regular polygons:

Episode 07 – Constructible polygons

(4)

Gauss’ result

A regular n-gon can be constructed with compass and straightedge if n is the product of a power of 2 and any number of distinct Fermat primes.

Gauss conjectured that this condition was also necessary. It was proved by Pierre Wantzel in 1837.

Episode 07 – Constructible polygons

(5)

Constructible polygons

Using Gauss’ result, we can decude that the regular n-gon is constructible for the following values of n :

3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 32, 34, 40, 48, 51, 60, 64, . . .

Episode 07 – Constructible polygons

(6)

Pascal’s triangle and the Sierpinski sieve

1

1 1

1 2 1

1 3 3 1

1 4 6 4 1

1 5 10 10 5 1

1 6 15 20 15 6 1

Episode 07 – Constructible polygons

(7)

Pascal’s triangle and the Sierpinski sieve

1

1 1

1 0 1

1 1 1 1

1 0 0 0 1

1 1 0 0 1 1

1 0 1 0 1 0 1

Episode 07 – Constructible polygons

(8)

Pascal’s triangle and the Sierpinski sieve

1 1

1 1 3

1 0 1 5

1 1 1 1 15

1 0 0 0 1 17

1 1 0 0 1 1 51

1 0 1 0 1 0 1 85

Episode 07 – Constructible polygons

Références

Documents relatifs

Rule 2 : When a line of the section plane is in a face, and a third point is on a face with an edge in common, you can draw the intersection of the line with the common edge..

To find the coordinates of the intersection of a plane with a line (if it exists), just solve the system made of a cartesian equation of the plane and a set of parametric equations

Leonhard Euler (1707 – 1783) Königsberg Castle before WWI. Episode 19 –

Erdös asks us to imagine an alien force, vastly more powerful than us, landing on Earth and demanding the value of R (5, 5) or they will destroy our planet. In that case, he claims,

Planar and plane graphs.. Plane

5 Set the unvisited vertex with the smallest distance (from the initial node) as the next current vertex and continue from

Addition and multiplication in the set Z [i ] follow the same rules as addition and multiplication of integers but “real parts” and “imaginary parts” cannot be mixed up

The set Z[i] is a unique factorization domain : any Gaussian integer can be written as a product of Gaussian primes, and this. decomposition is unique except for reordering