Moser's circle problem
Problem in geometry
Moser's circle problem asks how many regions a circle can be divided into by choosing n {\displaystyle n} points along the circumference of the circle and joining each pair of points by a straight line. The greatest possible number of regions with n {\displaystyle n} points is given by r G = ( n 4 ) + ( n 2 ) + 1 = 1 24 ( n 4 − 6 n 3 + 23 n 2 − 18 n + 24 ) , {\displaystyle r_{G}={n \choose 4}+{n \choose 2}+1={\frac {1}{24}}(n^{4}-6n^{3}+23n^{2}-18n+24),} resulting in the sequence 1, 2, 4, 8, 16, 31, 57, 99, 163, 256, ...
Nº Q5284051 ★
Commune · Histoire
Moser's circle problem
Problem in geometry
Moser's circle problem asks how many regions a circle can be divided into by choosing n {\displaystyle n} points along the circumference of the circle and joining each pair of points by a straight line. The greatest possible number of regions with n {\displaystyle n} points is given by r G = ( n 4 ) + ( n 2 ) + 1 = 1 24 ( n 4 − 6 n 3 + 23 n 2 − 18 n + 24 ) , {\displaystyle r_{G}={n \choose 4}+{n \choose 2}+1={\frac {1}{24}}(n^{4}-6n^{3}+23n^{2}-18n+24),} resulting in the sequence 1, 2, 4, 8, 16, 31, 57, 99, 163, 256, ...
Sur Wikipédia
Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.
Moser's circle problem asks how many regions a circle can be divided into by choosing n {\displaystyle n} points along the circumference of the circle and joining each pair of points by a straight line. The greatest possible number of regions with n {\displaystyle n} points is given by r G = ( n 4 ) + ( n 2 ) + 1 = 1 24 ( n 4 − 6 n 3 + 23 n 2 − 18 n + 24 ) , {\displaystyle r_{G}={n \choose 4}+{n \choose 2}+1={\frac {1}{24}}(n^{4}-6n^{3}+23n^{2}-18n+24),} resulting in the sequence 1, 2, 4, 8, 16, 31, 57, 99, 163, 256, ... (sequence A000127 in the OEIS). Though the first five terms match the geometric progression 2 n − 1 {\displaystyle 2^{n-1}} , the two sequences differ for n ≥ 6 {\displaystyle n\geq 6} . As Leo Moser noted in 1949, this sequence demonstrates the risk of generalising from only a few observations.
Texte : Wikipédia en anglais, CC BY-SA 4.0. · Image : Cmglee (CC BY-SA 4.0) ·
Cartes voisines
-
Quadrature du cercle
Problème géométrique
Nº Q193394 ★★★
Pas en vente
-
No-three-in-line problem
Topic in discrete geometry
Nº Q6580594 ★
Pas en vente
-
Problème de Napoléon
Nº Q2670506 ★
Pas en vente
-
Problème du cercle de Gauss
Nº Q2096220 ★
Pas en vente
-
Schéma géographique des Nations unies
Liste d'un projet Wikimedia
Nº Q1635230 ★★★
Pas en vente
-
G
Géométrie diophantienne
Nº Q16526038 ★
Pas en vente