Integrated Math 1 · Chapter 1 · Functions
Four students count the same tile border four different ways and write four different-looking expressions. All four are right, and showing that is the whole section.
bookSHelf · Integrated Math 1 · §1.1 · a self-paced section
Outline — by the end of this section you will be able to
§1.1.1 — The cafeteria tile problem
How many colored tiles are in the border? Find a method quick enough to trust without counting one tile at a time, and be ready to justify that it counts every tile exactly once.
Center squares come in all sizes. Find an expression for the colored border tiles around an N by N center, where N is however many tiles run along one side.
A good method for the 5 by 5 case is one that still makes sense when you cannot see the picture.
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | |
|---|---|---|---|---|---|---|---|---|---|
| 1 | ■ | □ | ■ | □ | ■ | □ | ■ | □ | ■ |
| 2 | □ | ■ | □ | ■ | □ | ■ | □ | ■ | □ |
| 3 | ■ | □ | · | · | · | · | · | □ | ■ |
| 4 | □ | ■ | · | · | · | · | · | ■ | □ |
| 5 | ■ | □ | · | · | · | · | · | □ | ■ |
| 6 | □ | ■ | · | · | · | · | · | ■ | □ |
| 7 | ■ | □ | · | · | · | · | · | □ | ■ |
| 8 | □ | ■ | □ | ■ | □ | ■ | □ | ■ | □ |
| 9 | ■ | □ | ■ | □ | ■ | □ | ■ | □ | ■ |
Table 1.1.1: The sample design — a checkerboard border two rows wide around a 5 by 5 center.
§1.1.1 — Definition
Definition 1.1.1 — Checkerboard Border
A checkerboard border of width two is a ring of tiles around a square block of center tiles. The ring is exactly two tiles thick on every side. It is colored so that no colored tile shares an edge with another colored tile.
Note what that rules out: not two tiles total, and not two tiles on one side only.
Definition 1.1.1: a ring exactly two tiles thick on every side, colored so that no colored tile touches another edge to edge.
Context Pause — the side grows by four, not by two
Walk across one row: 2 border tiles, then the 5 center tiles, then 2 more border tiles.
2+5+2=9 tiles on a side.The side length grows by 2+2=4 in total. Getting this wrong is the single most common way to miss this problem, and the error stays hidden all the way through the generalization.
§1.1.1 — Worked example
Example 1.1.1 — the center block is 5 by 5 and the border is two rows wide; find the finished floor's dimensions and its total tiles
Step 1 — walk across one row. Cross 2 border tiles, the 5 center tiles, then 2 more. Top to bottom works out identically, so the floor is a 9 by 9 square.
2+5+2=9Step 2 — count the whole floor. A square 9 tiles on a side holds
92=81 tiles.Answer: the floor is 9 tiles by 9 tiles and holds 81 tiles in all — 9 rows of 9 symbols in Table 1.1.1.
§1.1.2 — Counting the 5 by 5 border four different ways
Whole floor minus the center block. Subtraction cannot double-count, but it never touches the border directly. 92−52=56
Four equal strips, each 2 by 7, rotating like a pinwheel so every corner lands in exactly one strip. 4(2⋅7)=56
Four 2-by-5 side strips and four 2-by-2 corner blocks, counted as two different kinds of piece. 40+16=56
Two full-width 2-by-9 strips take the corners; two 2-by-5 strips fill the sides. 18+18+10+10=56
The goal is not to pick a favorite. It is to look at the grid and see each of the four decompositions in it.
§1.1.2 — The scoreboard
| Student | How they saw it | Arithmetic | Border tiles |
|---|---|---|---|
| Marisol | whole floor minus the center hole | 92−52 | 56 |
| Jamal | four equal 2-by-7 pinwheel strips | 4(2⋅7) | 56 |
| Priya | four 2-by-5 sides plus four 2-by-2 corners | 4(2⋅5)+4(2⋅2) | 56 |
| Wen | two 2-by-9 strips plus two 2-by-5 strips | 2(2⋅9)+2(2⋅5) | 56 |
Table 1.1.2: Four students, four decompositions of the same border.
That agreement is not luck. Every method chops up the same 56 tiles, so the answers were forced to match — and nobody had to trust anybody else's arithmetic to believe the total.
§1.1.2 — Worked example
Example 1.1.2 — a fifth student says the border is four sides, each a 2-by-9 rectangle, giving 4(2⋅9)=72; find the error and say exactly how many tiles it added
Step 1 — measure the gap. The claimed total is 72 and the correct total is 56, so 72−56=16 tiles were counted that should not have been.
Step 2 — look at a corner. The "top side" rectangle runs the full 9-tile width and contains the top-left 2-by-2 block. The "left side" rectangle runs the full 9-tile height and contains it too. Both claim the same 4 tiles.
Step 3 — count how often. Four corners, 4 tiles each, each counted twice.
4⋅4=16 extra tiles,72−16=56.Different-looking work is often the same answer seen differently. It is not automatically the same answer — sometimes it is a mistake, and you tell the difference by tracing every piece back to the picture.
§1.1.2 — Definition
Definition 1.1.2 — Valid Decomposition
A decomposition of a figure is a way of cutting it into pieces. The decomposition is valid when every tile belongs to exactly one piece — none is left out, and none is counted twice.
Adding up the pieces of a valid decomposition always gives the total.
Definition 1.1.2: every tile in exactly one piece, which is the test the four full-length sides fail at the corners.
§1.1.2 — Your turn
Try It Now 1.1.1 — use Priya's decomposition on the design in Table 1.1.1; say which piece the tile at row 1, column 1 belongs to, then do the same for row 1, column 5
Row 1, column 1 is the outermost corner of the top-left corner block, so it belongs to a corner piece.
Row 1, column 5 is in the middle of the top edge, directly above the center block, so it belongs to the top side strip.
Answer: row 1, column 1 is a corner tile; row 1, column 5 is a side-strip tile.
§1.1.3 — Exactly half the border tiles are colored
Claim: in a checkerboard border two rows wide, exactly half the tiles are colored
Every strip is exactly 2 thick, so it slices into pairs across that thickness. The two tiles in a pair share an edge, and in a checkerboard tiles that share an edge always have different colors — so every pair holds one colored tile and one white one, with no exceptions anywhere in the border.
Slicing across the thickness is what makes this work at every size: a side strip 5 tiles tall could not be cut into standing pairs at all, but cut across its 2-tile width it splits perfectly.
Insight — socks come in pairs
If a drawer holds nothing but pairs, and every pair has one black sock and one white sock, half the drawer is black. You do not need to know how many pairs there are.
The two-tile columns in this border are those pairs — which is why the halving survives a change of size, and a row-by-row count does not.
Context Pause — one argument replaces four recounts
Four students produced four totals for the border. Proving the half-and-half fact once means none of them has to count colored tiles separately — each divides their own total by 2.
One good argument saves four pieces of work, and it keeps saving them at every new size. A count tells you what happened this time; the argument tells you why it had to happen.
§1.1.3 — Worked example
Example 1.1.3 — count the colored tiles in Table 1.1.1 row by row, and check the result against the halving argument
Step 1 — read the ■ symbols across each row.
5+4+2+2+2+2+2+4+5Step 2 — add them up. Two full border rows top and bottom, five middle rows showing only the left and right edges.
9+10+9=28The rows are lopsided — the top row has 5 colored tiles and the row below it has 4 — and nothing in the row count explains why they still add to exactly half. The pairing argument does, because it never looks at rows at all.
§1.1.3 — Your turn
Try It Now 1.1.2 — a cafeteria has a 7 by 7 center block and the same two-row checkerboard border; (a) use Marisol's method for the total border tiles, (b) find the colored border tiles
(a) Subtract the hole. The border adds 2 at each end of a row, so the floor is 7+4=11 on a side.
112−72=121−49=72 border tiles.(b) Halve it. The border is two rows wide and checkerboarded, so it is made entirely of stacked pairs.
272=36 colored tiles.§1.1.4 — Generalizing to an N by N center
The floor is (N+4) by (N+4), the hole is N by N: (N+4)2−N2
Each 2 thick and N+2 long — the center's N plus one 2-tile corner: 4⋅2(N+2)
Four 2-by-N sides and four 2-by-2 corners: 4(2N)+4(4)
Two 2-by-(N+4) strips, two 2-by-N strips: 2⋅2(N+4)+2⋅2N
Each student's reasoning carries over word for word — only the numbers turn into letters, and the letters sit exactly where the 5 used to sit. The floor is now N+4 on a side, which gives 9 at N=5.
Insight — a recipe, not a meal
"Two eggs and 300 grams of flour" feeds one household. "Two eggs per 300 grams of flour, scaled to the number of guests" feeds any household.
The number 28 is a meal. The expression you are about to build is the recipe.
§1.1.4 — Definition
Definition 1.1.3 — Variable
A variable is a letter used to stand for a number whose value is not fixed. Writing an expression with a variable in it describes every case at once, so the expression can be evaluated for any particular value you are handed.
Here N stands for the side length of the center square in tiles. Writing N instead of 5 is a promise that nothing in the work depends on the number being 5, and every step from here has to keep that promise.
The first thing to redo is the outer dimension: the center is N across and the border adds 2 on each side, so the floor is N+4 tiles on a side. Everything else follows from that.
Context Pause — check the general answer against the case you already know
You counted 28 colored tiles for the 5 by 5 design before any letters appeared. That number is now a test: any expression you write must produce 28 when N=5.
Keeping one known case in your pocket catches most generalization errors on the spot — including the "grows by two" mistake, which is invisible in the algebra and obvious at N=5.
§1.1.4 — Halving for the colored tiles
| Student | Total border tiles | Colored |
|---|---|---|
| Marisol | (N+4)2−N2 | 2(N+4)2−N2 |
| Jamal | 4⋅2(N+2) | 4(N+2) |
| Priya | 4(2N)+4(4) | 4N+8 |
| Wen | 2⋅2(N+4)+2⋅2N | 2(N+4)+2N |
Table 1.1.3: Each method's total, and the colored count that is half of it.
Read each term back into the picture:
In 4(N+2), the 4 is four strips and the N+2 is the colored tiles in one strip — one per column of two.
In 4N+8, the 4N is four straight sides at N colored tiles each, and the 8 is four corner blocks at 2 each.
In 2(N+4)+2N, the first term is the top and bottom strips and the second is the left and right.
In 2(N+4)2−N2, the numerator is the whole floor with the center removed, and the 2 is the halving.
§1.1.4 — Worked example
Example 1.1.4 — rebuild Wen's two-long-strips-and-two-short method for an N by N center, write the expression for total border tiles, and check it at N=5
Step 1 — the long strips. The top strip runs the full width of the floor, now N+4 tiles, and is still 2 tall: 2(N+4) tiles. The bottom strip is identical.
Step 2 — the short strips. The long strips already took the corners, so each side strip is only as tall as the center: 2N tiles.
Step 3 — assemble and check at N=5.
2⋅2(N+4)+2⋅2N⟶4(9)+4(5)=36+20=56It matches the 56 tiles counted in §1.1.2, so the generalization kept its promise: nothing in the reasoning depended on the number being 5.
§1.1.4 — Your turn
Try It Now 1.1.3 — a cafeteria has a 12 by 12 center block and the same border; (a) use Priya's expression for the colored tiles, (b) use Jamal's on the same cafeteria
(a) Priya's 4N+8, with N=12.
4(12)+8=48+8=56 colored tiles.(b) Jamal's 4(N+2), same N.
4(12+2)=4(14)=56 colored tiles.The two agree, which is what we expect from two valid decompositions of one border.
§1.1.5 — Showing the expressions are equivalent
Substitute a value into all four and compare. Agreement at two values does not settle it — the contractor needs a formula that works for every N, including sizes nobody tested.
Rewrite each expression in the same form using the properties from §0.5, and see whether the forms coincide. They do — every one of them is 4N+8.
Now the claim is settled for every N at once, not for the two values we happened to try. That is the difference between checking and proving.
§1.1.5 — Testing a value is evidence, not proof
| Expression | Substituted | Value |
|---|---|---|
| 2(N+4)2−N2 | 292−52=281−25 | 28 |
| 4(N+2) | 4(7) | 28 |
| 4N+8 | 20+8 | 28 |
| 2(N+4)+2N | 2(9)+10=18+10 | 28 |
Table 1.1.4: All four expressions evaluated at N=5.
All 28 — and matching the tile count we made by hand before any letters appeared. That is worth having, and it is not yet a proof.
§1.1.5 — A second value
| Expression | Substituted | Value |
|---|---|---|
| 2(N+4)2−N2 | 2196−100=296 | 48 |
| 4(N+2) | 4(12) | 48 |
| 4N+8 | 40+8 | 48 |
| 2(N+4)+2N | 2(14)+20=28+20 | 48 |
Table 1.1.5: The same four expressions evaluated at N=10.
Agreement again — and a disagreement here would have proved immediately that something was wrong. But agreement at two values still says nothing about the third.
Context Pause — testing can refute, but it cannot confirm
One value where two expressions disagree proves they are not the same, and that is worth a lot.
A hundred values where they agree proves nothing about the hundred-and-first. "But I plugged in a number and it worked" is a common way to stay wrong.
§1.1.5 — Expanding settles it
| Step | Expression | Reason |
|---|---|---|
| 1 | 2(N+4)2−N2 | starting expression |
| 2 | 2N2+8N+16−N2 | expand (N+4)2 |
| 3 | 28N+16 | N2−N2=0 |
| 4 | 4N+8 | divide each term by 2 |
Table 1.1.6: Rewriting Marisol's expression step by step.
Jamal's takes one line — 4(N+2)=4N+8 by the distributive property — and Priya's is already there.
§1.1.5 — Expanding settles it
| Step | Expression | Reason |
|---|---|---|
| 1 | 2(N+4)+2N | starting expression |
| 2 | 2N+8+2N | distributive property |
| 3 | 2N+2N+8 | commutative property of addition |
| 4 | 4N+8 | combine like terms |
Table 1.1.7: Rewriting Wen's expression step by step.
Four routes in, one form out. The four expressions were never in competition — they were four descriptions of one ring of tiles.
Insight — same word, four languages
Four people say a word in four languages and it sounds like four different words. Translate all four into one shared language and they turn out to be the same word.
Expanding is that translation, and 4N+8 is the shared language.
§1.1.5 — Definition
Definition 1.1.4 — Equivalent Expressions
Two expressions are equivalent when they produce the same value for every allowed value of the variable.
You can show two expressions are not equivalent with a single value where they disagree. Showing that they are equivalent requires rewriting one into the other using properties that preserve value.
Definition 1.1.4: four different cuts, four different-looking expressions, one form they all rewrite to.
§1.1.5 — Your turn
Try It Now 1.1.4 — one classmate writes 4N+8 and another writes N2+3; both give 28 at N=5, so show the two are still not equivalent
Confirm the agreement first.
4(5)+8=28and52+3=28Try a second value — N=10, a cafeteria size nobody checked.
4(10)+8=48and102+3=103One disagreement is enough, permanently. The agreement at N=5 was a coincidence — which is exactly why testing can never confirm equivalence on its own.
§1.1.5 — Definition
Definition 1.1.5 — Simplified Form
The simplified form of an expression is the version with the fewest terms and no parentheses left. It is the form two equivalent expressions land on when each is rewritten as far as it will go, which is why it is the natural place to compare them.
But do not mistake "simplified" for "best." Different forms of the same expression are good at different jobs.
Definition 1.1.5: the fewest terms and no parentheses left, which is not the same thing as the best form for the job.
4N+8 is tidiest to compute with; 4(N+2) most obviously says four strips of the same size, which matters if you are cutting tile; Marisol's fraction is ugliest and the easiest to adapt if the border width changes. Choosing a form on purpose is a skill; simplifying on reflex is not.
§1.1.5 — Your turn
Try It Now 1.1.5 — a contractor's cafeteria has a 30 by 30 center; (a) which form would you compute with, (b) which form tells the cutter how many strips of what length, (c) compute the colored tiles
(a) For computing — Priya's 4N+8: the simplified form, one multiplication and one addition, no parentheses to track.
(b) For cutting — Jamal's 4(N+2): the 4 says four strips, the N+2 says each carries that many colored tiles. The structure of the expression is the instruction.
(c) The count, with N=30.
4(30)+8=128and4(30+2)=128§1.1.6 — How to work a problem as a team
You are not reporting the answer — everyone gets the answer. Say what you split the picture into, why nothing was double-counted or missed, and where each number came from. The middle one is the item people skip, and it is what caught the 72-tile error.
Set down the picture in your head and pick up theirs. The test: can you point at the grid and show their pieces? "Where does the 7 come from?" is always fair and never rude.
Test both at a value. If they agree, expand both. If the forms still differ, find the disagreement in the picture — somebody's pieces overlap or leave a gap.
The stance that works: your method and my method are two accounts of the same picture, so they should agree; let's find out whether they do, and if they don't, let's find out where.
§1.1.6 — Worked example
Example 1.1.5 — your partner hands you 2(2N+4) for the colored border tiles and you wrote 4N+8; work through the three steps and report what you find
Step 1 — test both at N=5, where the answer is already known to be 28.
2(2⋅5+4)=2(14)=28and4(5)+8=28Step 2 — expand both. Distribute the outside 2; yours is already simplified. 2(2N+4)=4N+8
Step 3 — compare the forms. Both are 4N+8, so they are equivalent and step 3 of the routine is not needed. Nobody made an error.
Read it back into the picture: 2(2N+4) says take one long side plus one short side, holding 2N+4 colored tiles together, and double it because the border has two of each. A fifth valid way of seeing the same ring.
§1.1.6 — Your turn
Try It Now 1.1.6 — a classmate says "I counted the border of the 5 by 5 design and got 28." (a) why is that a weak explanation, in terms of the three parts? (b) rewrite it strongly for one specific cut, with its expression; (c) their partner got 32 for the same design — what should the group do first, and why can testing a value not settle it?
(a) It reports an answer and nothing else — no pieces and their dimensions, no reason nothing was double-counted or missed, no expression to check against another. Everyone gets 28, so the number is the least informative thing that could have been said.
(b) For instance, four straight sides 2 tiles thick and 5 tiles long give 4(2⋅5)=40, and the four 2-by-2 corner blocks add 4(4)=16; every tile is in exactly one piece because the sides stop where the corners begin. Expression: 4(2N)+4(4), which at N=5 gives 56 border tiles, 28 of them colored.
(c) Do not test another value. 28 and 32 already disagree at N=5, so a test has said an error exists without saying where. Have the person who got 32 explain their pieces and dimensions while the others point at the grid — the error is a tile counted twice or missed, and it lives in a specific piece that only the explanation exposes.
§1.1.6 — In groups of three or four
Collaborative Exercise
Take a fresh copy of the design in Table 1.1.1 and have each person count the border a different way, without talking to each other.
Then take turns. Each person explains their pieces using the three parts listed above, while the others point at the grid and locate those pieces. Anyone may ask "where does that number come from?" at any time.
Finish by writing all of your expressions in a row and expanding each one. If any two do not land on the same simplified form, find the tile that was counted twice or the tile that was missed.
Key Terminology — the five words this section defines
checkerboard border — a ring of tiles two tiles thick on every side, colored so that no colored tile shares an edge with another colored tile.
decomposition — a way of cutting a figure into pieces; it is valid when every tile belongs to exactly one piece.
variable — a letter used to stand for a number whose value is not fixed.
equivalent expressions — two expressions that produce the same value for every allowed value of the variable.
simplified form — the version of an expression with the fewest terms and no parentheses left.
The headline result
Every valid decomposition of the border lands on 4N+8
Four students cut the same ring four ways and wrote four expressions that share almost no numbers. Expanded, all four are one expression — and it answers the contractor's question at every size, not just at 5.
† The 5 by 5 design gave 28 colored tiles, which is a fact about one cafeteria. 4N+8 is a fact about every cafeteria, and it is worth incomparably more.
§1.1 — Conclusions
Describe a pattern in a way that no longer depends on the size you were shown. Different-looking expressions built from different cuts of one picture are usually the same expression, and expanding both is what proves it. Every term should trace back to tiles you can point at.
Growing the side by 2 instead of 4; four full-length sides that double-count all four corners; treating "it worked at N=5" as proof; and simplifying on reflex when the unsimplified form was the one that told the cutter what to do.
Next: §1.2 makes generalizing a procedure you run on a table of values, rather than an insight you wait for — and §1.3 names what you built here a function. Back to start.