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 ★
Comum · História
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, ...
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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.
Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Cmglee (CC BY-SA 4.0) ·
Cartas próximas
-
Quadratura do círculo
Nº Q193394 ★★★
Sem ofertas
-
No-three-in-line problem
Topic in discrete geometry
Nº Q6580594 ★
Sem ofertas
-
Napoleon's problem
Given a circle and its centre, the problem of dividing the circle into four equal arcs using only a compass
Nº Q2670506 ★
Sem ofertas
-
Problema do círculo de Gauss
Nº Q2096220 ★
Sem ofertas
-
Geoesquema das Nações Unidas
Regionalização do mundo feita pela ONU
Nº Q1635230 ★★★
Sem ofertas
-
G
Geometria diofantina
Área da matemática
Nº Q16526038 ★
Sem ofertas