PrepShorts · Study sheet · Class 8 Mathematics · Chapter 1, A Square and A CubePrepShorts

Chapter 1 · A Square and A Cube

What makes a number a perfect square

यह वीडियो हिंदी में भी · Watch in Hindi

Square numbers10 min

This video could not be loaded. Reload the page to try again.

Sign in with Google

10 min.

Also recorded in Hindi.Englishहिन्दी

A hundred lockers, a hundred people, each changing every second, third, fourth. The doors left open at the end are exactly the perfect squares.

The idea

Divisors come in couples: name a divisor and the number hands you its co-divisor, the one you multiply it by to get back. Couples come two at a time, so the tally of divisors is forced to be even — unless one divisor is its own partner, which happens exactly when the number is that divisor times itself. That is the whole reason the queen's puzzle leaves the square-numbered lockers open, and it is a better answer to "what is a square number?" than n × n. The geometric picture (an n-by-n array of unit squares) and the arithmetic symptom (a divisor with no partner but itself) are one fact seen twice.

What you should be able to do

  • Explain why a locker's toggle count is exactly the count of factors of its number
  • Pair off the factors of a given number into partner factors, and identify the number that has no distinct partner
  • Argue that a natural number has an odd count of factors exactly when it is a square, and use that to predict which lockers stay open
  • Identify the numbers whose factor count is exactly two, and name them as primes
  • Connect the sidelength of a square to its area, and read 1, 4, 9, 16, 25, 100 off that connection
  • Write and read the notation n² for n × n
  • Square a fraction and a decimal, not only a whole number
  • Distinguish a square number from a perfect square in the chapter's own sense

Words to know

TermDefinition in one lineFirst introduced
factora number that divides the given number exactlyassumed known; used from Part I p.2
partner factorthe co-divisor you multiply a factor by to recover the numberprinted in this chapter (Part I p.2)
square numbera number that is some number times itselfprinted in this chapter (Part I p.2)
squarethe short form the chapter uses for a square numberprinted in this chapter (Part I p.2)
perfect squarea square of a natural numberprinted in this chapter (Part I p.4)
sidelengththe length of one side of a squareprinted in this chapter (Part I p.3)
areathe count of unit squares a figure coversassumed known; tabulated at Part I p.3
prime numbera number whose only factors are 1 and itselfassumed known; used at Part I p.3
n squaredhow n² is read aloudprinted in this chapter (Part I p.3)
self-paired factora factor whose partner is itselfan added term; the chapter describes the situation and gives it no label
toggleto close an open locker or open a closed oneprinted in this chapter (Part I p.1)

Where people slip up

  • "A square number is one you get by multiplying, and the odd factor count is a separate curiosity." They are the same statement. Squareness is the failure of the divisor pairing to pair everything off.
  • "Every number has an even number of factors." 1, 4 and 9 are the chapter's three counterexamples, printed side by side.
  • "36 has the pair 6 × 6, so it has an odd factor count — done." Not yet. You also need that no other factor of 36 is self-paired. The chapter asks for exactly that check and an explanation that skips it has skipped the proof.
  • **"Person d toggles locker n whenever d is less than n."** Only when d divides n. Person 7 never touches locker 12.
  • "1 is a special case that spoils the rule." 1 = 1 × 1 is the first square and the cleanest instance: its single factor is its own partner.
  • "Only whole numbers can be squared." The chapter squares 3/5 and 2.5 on the same page it defines the notation.
  • "A square is a shape; a square number is a number; the shared word is an accident." The chapter's own history section (Part I pp.15–16) shows the word carried both meanings from the start — see The oldest known tables of squares and cubes.
  • "Lockers touched twice are the even-numbered ones." Touched twice means exactly two factors, which is the definition of prime.
Transcript1,447 words

A corridor, a hundred lockers numbered one to a hundred, every one of them shut. A hundred people are going to walk down it, one after another. The first person opens every locker. The second visits every second locker - two, four, six - and changes what they find: open doors they shut, shut doors they open. The third person does the same to every third locker. And so on down to the hundredth person, who touches one door and goes home.

When the last of them has gone, some are open and some shut. Which ones are open? You could find out by walking the corridor; by the end of this we will name them without walking it at all. Forget the other ninety-nine and watch locker six. Person one touches everything, so person one touches it. Person two does, because six is every second locker. Person three does. Person four does not - four, eight, twelve, and six is not on that list - and nor does person five.

Person six does, and then nobody, because everyone left starts past it. Four people. Now the thing that decides its fate. It started shut and every touch flips it: shut, open, shut, open, shut. Four flips, and it is exactly where it began. A locker finishes open when the number of people who touched it is odd, and shut when it is even. Not who they were, not what order they came in. Just how many.

Open doors will be gold from here on, shut ones grey. So it is a counting question, and we should work out what we are counting. When does person d touch locker n? Person d visits d, two d, three d - the multiples of d. So person d touches locker n exactly when d divides n, leaving nothing over. Back at locker six, the people who touched it were one, two, three and six.

Those are precisely the numbers that divide six - all of them, and nothing else. So the corridor has stopped being about doors. The number of people who touch locker n is the number of divisors n has. And the real question is: for which numbers is that count odd? Divisors do not turn up one at a time. Three divides thirty-six - and thirty-six divided by three is twelve, so twelve divides thirty-six as well.

They arrive together, as a couple, because three times twelve is thirty-six. I will draw that as an arc joining the two of them, and the arc will always mean the same thing: these two multiply to give the number. Take six: one and six, two and three. Two arcs, four divisors. Take ten: one and ten, two and five. Four again. Every arc brings in two divisors, so the count climbs two at a time from nothing, which makes it even.

Every time? Try thirty-six. One and thirty-six. Two and eighteen. Three and twelve. Four and nine. And then six. Six times six is thirty-six, so the partner of six is six. There is nobody to join it to. The arc closes on itself, and I will draw that as a loop. Count them: one, two, three, four, six, nine, twelve, eighteen, thirty-six. Nine divisors. Odd. So locker thirty-six should end open - and walk the corridor, and it is.

This is the point where it is easy to stop one step too soon. The tempting sentence is: thirty-six has six times six, so its count is odd, done. That is not done. Look at what the count actually is. Two for every arc, plus one for every loop. Four arcs is eight, plus one loop, is nine. It came out odd because the number of loops was odd. One is odd - but so is three.

Three loops would give even plus three, still odd, and the argument would survive. Two loops would give even plus two, which is even, and the door shut. So knowing that thirty-six has a loop is not enough. We need to know how many loops a number can have. A loop is a divisor d with d times d equal to n. For a given n there is exactly one number that does that, or there is none at all.

There is never a second one. That single sentence is what the whole argument is standing on. Now there are only two cases. No loop: two for each arc, so the count is even and the door is shut. One loop: even plus one, so it is odd, and the door is open. There is no third case. A locker ends open exactly when its number has a divisor that is its own partner - exactly when the number is d times d for some whole number d.

Which lockers are those? One, four, nine, sixteen, twenty-five, thirty-six, forty-nine, sixty-four, eighty-one, a hundred. Ten doors out of a hundred, and we named every one of them without a single person walking anywhere. One is the number people expect the rule to break on, and it is the opposite of that. One has a single divisor, and that divisor is one. Its partner is one divided by one, which is one again.

So it pairs with itself. No arcs, one loop, a count of one. One is odd, so the door is open - and locker one is open. And one is one times one. It is not an awkward case the rule has to survive. It is the cleanest example of the rule there is. A second question about the same corridor. Which lockers were touched exactly twice - two divisors and no more?

Every number has one and itself on its list, so a number with exactly two divisors is a number with nothing in between. That is what a prime is. Two, three, five, seven, eleven, and on from there. And watch what happens to one. For one to be on the list its two divisors would have to be one and itself, and those are the same number. One is touched once, not twice.

It falls out on its own, and nobody has to remember to keep it out. There is a word for the numbers that ended up open, and it is worth seeing where it comes from. Lay out tiles in a square array. One tile along each side: one in total. Two along each side: four. Three: nine. Four: sixteen. Five: twenty-five. Ten along each side: a hundred. Those areas are the open lockers, in order.

The word square is not a metaphor here. A number is a square because it is the area of a square whose side is a whole number of units. And the side is the divisor with no partner - the one that opened the door. Writing n times n gets tiring, so it is written n with a small two raised beside it: n squared. Five squared is twenty-five. The small two counts how many n's are multiplied together.

It is not something you multiply by, and that is worth saying, because squaring is not doubling. Two and a half doubled is five. Two and a half squared is six point two five. You can square anything, not only whole numbers. Three fifths squared is nine over twenty-five - top times top, bottom times bottom. Notice that one came out smaller than what we started with, which doubling never does.

Nine over twenty-five is a square. It is not a perfect square. A perfect square is what you get when the thing squared was a natural number: one, four, nine, sixteen, twenty-five. Six point two five is a square too, and not a perfect one, because two and a half is not a natural number. So the doors that finished open are precisely the perfect squares from one to a hundred.

That is a much stronger statement than a list of ten numbers: it tells you what a corridor of a thousand lockers would do, without your having to build one. Nobody walked the corridor. A question about doors became a question about counting, because a door's fate depends on nothing except how many times it was touched. Counting became pairing, because divisors arrive two at a time, each one with a partner.

Pairing had exactly one thing that could go wrong: a divisor whose partner is itself. And that one exception turned out to be a shape. The doors left open are the areas of squares. Each step was small, and together they turned a hundred separate questions into one. That is the trade this subject keeps making.

Where this fits

Taken from the notes each video was made from, not from the reading order — these are the ideas this one rests on and the ones that later rest on it.

Comes up again in

Either side of this one

The book

Open in a new tab