08.08.2018 Views

RIC-0563 Developing algebraic thinking

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

PENTOMINO PUZZLES<br />

Teachers notes<br />

Introduction<br />

Looking at<br />

the algebra<br />

Geometrically, a polyomino is a set of squares connected side-byside.<br />

Dominoes are examples of polyominoes. A pentomino is a set of<br />

five squares connected side-by-side. There are twelve pentominoes;<br />

however, only eight pentominoes lend themselves to problem-solving<br />

involving algebra.<br />

Although the pentominoes are all different, the algebra involved is<br />

the same for certain groups.<br />

Group 1<br />

a<br />

b c d e<br />

a<br />

c b d e<br />

For these two pentominoes, we have a + b = b + c + d + e, or a = c + d + e.<br />

The result shows that the digit representing b<br />

can be any digit 0 to 9.<br />

The greatest possible sum for a + b is 17, which comes from 8 + 9 or 9<br />

+ 8. The smallest possible sum for either pentomino can be obtained<br />

with b = 0, a = 6 = 1 + 2 + 3. Therefore c, d and e are equal to 1, 2 and 3<br />

in any order.<br />

Here are some solutions:<br />

7<br />

8<br />

6<br />

9<br />

3 0 2 5<br />

1 9 3 4<br />

1 7 2 3<br />

3 1 4 2<br />

Group 2<br />

A second group contains three pentominoes.<br />

d<br />

b c a b a c<br />

b a c<br />

d<br />

d<br />

e<br />

e<br />

e<br />

For each, a + b + c = a + d + e, or b + c = d + e.<br />

The greatest sum of 22 occurs when a = 9.<br />

The greatest possible sum for two pairs of digits is 13 = 8 + 5 = 7 + 6.<br />

The least possible sum of 5 occurs when a = 0; therefore, the least<br />

possible sum of the two pairs is 5 = 1 + 4 = 2 + 3<br />

Here are some solutions:<br />

5<br />

3<br />

9<br />

1 7 0 6<br />

4<br />

1<br />

7<br />

8<br />

8<br />

6<br />

4<br />

5<br />

94 DEVELOPING ALGEBRAIC THINKING www.ricgroup.com.au R.I.C. Publications ®<br />

ISBN 978-1-74126-088-5

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!