Scribd
Upload
100 views6 pages

Induction Problems at Cheenta Ganit Kendra

The document describes 8 problems related to induction: 1) Tiling a chessboard with L-shaped trominoes, 2) Repeatedly replacing numbers on a board until empty, 3) Relating vertices, edges, and faces of a graph, 4) Using a scale to find a counterfeit coin among n coins with minimum weighings, 5) Writing powers of 13 as sums of squares, 6) Transforming the string "MI" to "MU" using specified operations, 7) Proving an inequality involving square roots, 8) Showing an expression involving the golden ratio is always a natural number.

Uploaded by

Raghav Goel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100 views6 pages

Induction Problems at Cheenta Ganit Kendra

The document describes 8 problems related to induction: 1) Tiling a chessboard with L-shaped trominoes, 2) Repeatedly replacing numbers on a board until empty, 3) Relating vertices, edges, and faces of a graph, 4) Using a scale to find a counterfeit coin among n coins with minimum weighings, 5) Writing powers of 13 as sums of squares, 6) Transforming the string "MI" to "MU" using specified operations, 7) Proving an inequality involving square roots, 8) Showing an expression involving the golden ratio is always a natural number.

Uploaded by

Raghav Goel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Induction

LEVEL 4

Cheenta Ganit Kendra

Speaker: A.R Sricharan

Cheenta LEVEL 4 1/6


Induction

Problem

Problem 1
Any 2n ×2n chessboard can be tiled using one monomino and some L-shaped
trominoes.

Problem 2
Some positive integers are written on the board. At each step one of the
integers n is erased and replaced with any number of positive integers that
are all less than n. Of course, if the erased integer is 1 then no new positive
integers can be written on the board. Does the board eventually become
empty no matter how this procedure is carried out?

Cheenta LEVEL 4 2/6


Induction

Problem

Problem 3
Suppose you draw a graph on a sheet of paper without edges crossing, such
that it has V vertices, E edges and F faces. Then show that V - E + F = 2.

Problem 4
Suppose you are a merchant who just got paid n gold coins for your wares,
and you know that exactly one of those gold coins is counterfeit and weighs
less than all the other ones. To prove this, you want to use a balance
weighing scale to find which exact coin is counterfeit. However the owner
of the balance scale charges you 10 rupees every time you use the scale.
What is the least number of weighings you can do to find out which coin is
counterfeit?

Cheenta LEVEL 4 3/6


Induction

Problem

Problem 5
Show that any power of 13 can be written as a sum of two squares.

Problem 6
Suppose you start with the string MI, and you are allowed the following
operations on the string:
Double the contents of the string after the M.
Replace III with U.
Append U to the string if it ends in I.
Remove any UU.
How do you start at MI and end at MU?

Cheenta LEVEL 4 4/6


Induction

Problem

Problem 7
Prove that for any natural number n ≥ 2,
1 1 1 2
    
1− √ 1 − √ ··· 1 − √ <
2 3 n n2

Problem 8
Show that √ √
(1 + 5)n − (1 − 5)n
un = √
2n · 5
is a natural number for all n ∈ N.

Cheenta LEVEL 4 5/6


Induction

Workout

Cheenta LEVEL 4 6/6

You might also like