Download presentation
Presentation is loading. Please wait.
Published byAntony Singleton Modified over 9 years ago
1
What Makes a Good Problem?
4
Kobon Fujimura
5
3 lines 1 triangle
6
4 lines 2 triangle
7
5 lines 5 triangles
8
6 lines 7 triangles
10
7 lines 11 triangles
11
8 lines 12 triangles
12
9 lines 21 triangles
13
10 lines 25 triangles
14
13 lines 47 triangles
15
15 lines 65 triangles
16
Number of Lines (n) Upper limit of Triangles: n(n-2)/3 rounded down Best Discovered 311 422 555 687 711 81615 921 102625 113332 124038 1347 145653 1565
17
Number of Lines (n)n(n-2)/3 rounded downBest Discovered 311 422 555 687 711 81615 921 102625 113332 124038 1347 145653 1565
18
Number of Lines (n) Upper limit of Triangles: n(n-2)/3 rounded down Best Discovered 311 422 555 687 711 81615 921 102625 113332 124038 1347 145653 1565
19
Number of Lines (n) Upper limit of Triangles: n(n-2)/3 rounded down Best Discovered 311 422 555 687 711 81615 921 102625 113332 124038 1347 145653 1565
20
Number of Lines (n) Upper limit of Triangles: n(n-2)/3 rounded down Best Discovered 311 422 555 687 711 81615 921 102625 113332 124038 1347 145653 1565
21
Number of Lines (n) Upper limit of Triangles: n(n-2)/3 rounded down Best Discovered 311 422 555 687 711 81615 921 102625 113332 124038 1347 145653 1565
22
3 lines 1 triangle
23
4 lines 2 triangle
24
5 lines 5 triangles
25
6 lines 7 triangles
27
7 lines 11 triangles
28
8 lines 12 triangles
29
9 lines 21 triangles
30
10 lines 25 triangles
31
13 lines 47 triangles
32
15 lines 65 triangles
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.