Mathematical Investigations

Investigation
Activity
Investigation
Process
Mark a number of
points on a circle
and join them by
chords. Investigate.
Exploring Systematically
No. of No. of
Points chords
0 0
No. of No. of
Points chords
0 0
1 0
No. of No. of
Points chords
0 0
1 0
2 1
No. of No. of
Points chords
0 0
1 0
2 1
3 3
No. of No. of
Points chords
0 0
1 0
2 1
3 3
4 6
No. of No. of
Points chords
0 0
1 0
2 1
3 3
4 6
5 10
No. of No. of
Points chords
0 0
1 0
2 1
3 3
4 6
5 10
6 15
Conjecturing
No. of No. of chords No. of No. of

Points Points chords
0 0 0 0
1 0 1 0
2 2 1
3 3 3
4 4 6
5 5 10
6 6 15
Conjecturing

0 0 0 0
1 0 1 0
2 (2)(1/2) 2 1
3 3 3
4 4 6
5 5 10
6 6 15
Conjecturing

0 0 0 0
1 0 1 0
2 (2)(1/2) 2 1
3 3(1)=3(2/2)=3[(3-1)/2] 3 3
4 4 6
5 5 10
6 6 15
Conjecturing

0 0 0 0
1 0 1 0
2 (2)(1/2) 2 1
3 3(1)=3(2/2)=3[(3-1)/2] 3 3
4 4(3/2)=4[(4-1)/2] 4 6
5 5 10
6 6 15
Conjecturing

0 0 0 0
1 0 1 0
2 (2)(1/2) 2 1
3 3(1)=3(2/2)=3[(3-1)/2] 3 3
4 4(3/2)=4[(4-1)/2] 4 6
5 5(2)=5(4/2)=5[(5-1)/2] 5 10
6 6 15
Conjecturing

0 0 0 0
1 0 1 0
2 (2)(1/2) 2 1
3 3(1)=3(2/2)=3[(3-1)/2] 3 3
4 4(3/2)=4[(4-1)/2] 4 6
5 5(2)=5(4/2)=5[(5-1)/2] 5 10
6 6(3/2)=6[(6-1)/2] 6 15
Conjecturing

0 0 0 0
1 0 1 0
2 (2)(1/2) 2 1
3 3(1)=3(2/2)=3[(3-1)/2] 3 3
4 4(3/2)=4[(4-1)/2] 4 6
5 5(2)=5(4/2)=5[(5-1)/2] 5 10
6 6(3/2)=6[(6-1)/2] 6 15
No. of No. of chords

Points
n
Conjecturing

0 0 0 0
1 0 1 0
2 (2)(1/2) 2 1
3 3(1)=3(2/2)=3[(3-1)/2] 3 3
4 4(3/2)=4[(4-1)/2] 4 6
5 5(2)=5(4/2)=5[(5-1)/2] 5 10
6 6(3/2)=6[(6-1)/2] 6 15
No. of No. of chords

Points
n n[(n-1)/2]
MISCONCEPTIONS IN MATHEMATICAL INVESTIGATIONS
These are conjectures that are too shallow.

These are statements that are OBVIOUSLY TRUE without proof.
Remember, conjectures are statements that needs to be
proven.
THE FARTHER THE POINTS, THE

LONGER THE CHORD.
MISCONCEPTIONS IN MATHEMATICAL INVESTIGATIONS
These are conjectures that are too shallow.

These are statements that are OBVIOUSLY TRUE without proof.
Remember, conjectures are statements that needs to be
proven.
THE NUMBER OF SIDES OF A

POLYGON FORMED IS EQUAL TO THE
NUMBER OF POINTS ON THE CIRCLE.
A chocolate bar that
divides into m by n small
squares. Break the bar
along one horizontal or
vertical lines separating
into all individual (1 x 1)
squares. Investigate.
mxn Number of
Cuts
1X1 0
mxn Number of
Cuts
1X1 0
1X2 1
mxn Number of
Cuts
1x1 0
1x2 1
2x2 3
mxn Number of
Cuts
1x1 0
1x2 1
2x2 3
2x3 5
mxn Number of
Cuts
1x1 0
1x2 1
2x2 3
2x3 5
3x3 8
mxn Number of
Cuts
1x1 0
1x2 1
2x2 3
2x3 5
3x3 8
4x6 23
Conjecturing
mxn Number of
Given an m x n chocolate Cuts
bar is to be cut into all 1x1 0
individual squares such 1x2 1
that m, n ≠ 0 then the 2x2 3
number of cuts is 2x3 5

3x3 8
4x6 23
(m)(n) - 1
Conjecturing
mxn Number of
Given an m x n chocolate Cuts
bar is to be cut into all 1x1 0
individual squares such 1x2 1
that m, n ≠ 0 then the 2x2 3
number of cuts is 2x3 5

3x3 8
4x6 23
(m)(n) - 1 mxn (m)(n) - 1
Given m and n are
consecutive integers
where n > m and m > 0.
Investigate m x n + n.
m n mxn+n
0 1
m n mxn+n
0 1 1
1 2
m n mxn+n
0 1 1
1 2 4
2 3
m n mxn+n
0 1 1
1 2 4
2 3 9
3 4
m n mxn+n
0 1 1
1 2 4
2 3 9
3 4 16
4 5
m n mxn+n
0 1 1
1 2 4
2 3 9
3 4 16
4 5 25
5 6
m n mxn+n
0 1 1
1 2 4
2 3 9
3 4 16
4 5 25
5 6 36
6 7
m n mxn+n
0 1 1
1 2 4
2 3 9
3 4 16
4 5 25
5 6 36
6 7 49
Conjecturing
Given m and n m n mxn+n

are consecutive 0 1 1
integers where 1 2 4
n > m and m >
0. Then, 2 3 9
3 4 16
m x n + n = n2 4 5 25
5 6 36
6 7 49
Conjecturing
Given m and n m n mxn+n n2
are consecutive 0 1 1 1
integers where 1 2 4 4
n > m and m >
0. Then, 2 3 9 9
3 4 16 16
m x n + n = n2 4 5 25 25
5 6 36 36
6 7 49 49
Given three different non-
zero digits, make all
possible 3-digit numbers
and find the sum of
these. Investigate
3-digit Sum
123 123
132
213
231
312
321
1332
3-digit Sum
256 123 1332
265 256
526
562
625
652
2886
3-digit Sum
149 123 1332
194 256 2886
149
419
491
914
941
3108
3-digit Sum
789 123 1332
798 256 2886
149 3108
879 789
897
978
987
5328
3-digit Sum
528 123 1332
582 256 2886
149 3108
258 789 5328
285 528
852
825
3330
3-digit Sum
345 123 1332
354 256 2886
149 3108
435 789 5328
453 528 3330
534
345
543
2664
3-digit Sum
345 123 1332
354 256 2886
149 3108
435 789 5328
453 528 3330
534
345 2664
543
2664
Conjecturing
If a, b and c are the 3-digit Sum
digits of a 3-digit 123

256
1332
2886
number such that 149 3108
a, b and c are not 789

528
5328
3330
equal to zero, then 345 2664
(a+b+c)(222) = abc+acb+bac+bca+cab+cba
Consider two consecutive
numbers. Investigate the
difference of their
squares.
m n m2 n2 n2-m2
1
2
3
4
5
6
m n m2 n2 n2-m2
1 2
2 3
3 4
4 5
5 6
6 7
m n m2 n2 n2-m2
1 2 1
2 3 4
3 4 9
4 5 16
5 6 25
6 7 36
m n m2 n2 n2-m2
1 2 1 4
2 3 4 9
3 4 9 16
4 5 16 25
5 6 25 36
6 7 36 49
m n m2 n2 n2-m2
1 2 1 4 3
2 3 4 9 5
3 4 9 16 7
4 5 16 25 9
5 6 25 36 11
6 7 36 49 13
Conjecturing
m n m2 n2 n2-m2
1 2 1 4 3
2 3 4 9 5
3 4 9 16 7
4 5 16 25 9
5 6 25 36 11
6 7 36 49 13
Given two consecutive numbers m and n

such that n > m then
n2 – m2 = m + n
Conjecturing
m n m2 n2 n2-m2
1 2 1 4 3
2 3 4 9 5
3 4 9 16 7
4 5 16 25 9
5 6 25 36 11
6 7 36 49 13
m n m2 n2 m+n
Given two consecutive numbers m and n

such that n > m then
n2 – m2 = m + n

Mathematical Investigations

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Mathematical Investigations

Caricato da

Copyright:

Formati disponibili

Investigation

No. of No. of chords No. of No. of

No. of No. of chords No. of No. of

No. of No. of chords No. of No. of

No. of No. of chords No. of No. of

No. of No. of chords No. of No. of

No. of No. of chords No. of No. of

No. of No. of chords No. of No. of

No. of No. of chords

No. of No. of chords No. of No. of

No. of No. of chords

These are conjectures that are too shallow.

THE FARTHER THE POINTS, THE

These are conjectures that are too shallow.

THE NUMBER OF SIDES OF A

number of cuts is 2x3 5

number of cuts is 2x3 5

Given m and n m n mxn+n

Given m and n m n mxn+n n2

If a, b and c are the 3-digit Sum

digits of a 3-digit 123

a, b and c are not 789

Given two consecutive numbers m and n

Given two consecutive numbers m and n

Potrebbero piacerti anche