Question 1
Arrange the stick figure cutouts given at the end of the book or draw a height arrangement such that the sequence reads:
(a) 0, 1, 1, 2, 4, 1, 5
(b) 0, 0, 0, 0, 0, 0, 0
(c) 0, 1, 2, 3, 4, 5, 6
(d) 0, 1, 0, 1, 0, 1, 0
(e) 0, 1, 1, 1, 1, 1, 1
(f) 0, 0, 0, 3, 3, 3, 3
The sequence for an arrangement of stick figures tells us, for each figure, how many figures to its left are shorter than it.
Step 1 — Determine stick figure heights
Let us assign a unique height to each stick figure. We will use heights from 0 to 6. Let us look at sequence (c): 0, 1, 2, 3, 4, 5, 6. The arrangement for this sequence is FDBGCEA. For the first figure F, there are 0 shorter figures to its left. This is always true. For the second figure D, there is 1 shorter figure to its left. This means F is shorter than D. For the third figure B, there are 2 shorter figures to its left. This means F and D are shorter than B. This pattern continues for all figures. Each figure is taller than all figures placed before it. So, the heights must be in increasing order: F < D < B < G < C < E < A. Let us assign the heights: Let us check this with sequence (b): 0, 0, 0, 0, 0, 0, 0. The arrangement for this sequence is AECGBDF. For the first figure A, there are 0 shorter figures to its left. For the second figure E, there are 0 shorter figures to its left. This means A is not shorter than E. So A is taller than E. This pattern continues for all figures. Each figure is shorter than all figures placed before it. So, the heights must be in decreasing order: A > E > C > G > B > D > F. This matches our assigned heights perfectly.
Step 2 — Verify arrangement for (a) 0, 1, 1, 2, 4, 1, 5
The required arrangement is FCBGADE. Let us list the figures in this order with their heights: F(0), C(4), B(2), G(3), A(6), D(1), E(5). Now, let us count shorter figures to the left for each position:
- For F(0): No figures are to its left. So, 0 shorter figures.
- For C(4): Figure to its left is F(0). F(0) is shorter than C(4). So, 1 shorter figure.
- For B(2): Figures to its left are F(0), C(4). F(0) is shorter than B(2). C(4) is taller than B(2). So, 1 shorter figure.
- For G(3): Figures to its left are F(0), C(4), B(2). F(0) and B(2) are shorter than G(3). C(4) is taller. So, 2 shorter figures.
- For A(6): Figures to its left are F(0), C(4), B(2), G(3). All are shorter than A(6). So, 4 shorter figures.
- For D(1): Figures to its left are F(0), C(4), B(2), G(3), A(6). F(0) is shorter than D(1). Others are taller. So, 1 shorter figure.
- For E(5): Figures to its left are F(0), C(4), B(2), G(3), A(6), D(1). F(0), C(4), B(2), G(3), D(1) are shorter than E(5). A(6) is taller. So, 5 shorter figures. The sequence obtained is 0, 1, 1, 2, 4, 1, 5. This matches the given sequence.
Step 3 — Verify arrangement for (b) 0, 0, 0, 0, 0, 0, 0
The required arrangement is AECGBDF. Let us list the figures in this order with their heights: A(6), E(5), C(4), G(3), B(2), D(1), F(0). Now, let us count shorter figures to the left for each position:
- For A(6): No figures are to its left. So, 0 shorter figures.
- For E(5): Figure to its left is A(6). A(6) is taller than E(5). So, 0 shorter figures.
- For C(4): Figures to its left are A(6), E(5). Both are taller than C(4). So, 0 shorter figures.
- For G(3): Figures to its left are A(6), E(5), C(4). All are taller than G(3). So, 0 shorter figures.
- For B(2): Figures to its left are A(6), E(5), C(4), G(3). All are taller than B(2). So, 0 shorter figures.
- For D(1): Figures to its left are A(6), E(5), C(4), G(3), B(2). All are taller than D(1). So, 0 shorter figures.
- For F(0): Figures to its left are A(6), E(5), C(4), G(3), B(2), D(1). All are taller than F(0). So, 0 shorter figures. The sequence obtained is 0, 0, 0, 0, 0, 0, 0. This matches the given sequence.
Step 4 — Verify arrangement for (c) 0, 1, 2, 3, 4, 5, 6
The required arrangement is FDBGCEA. Let us list the figures in this order with their heights: F(0), D(1), B(2), G(3), C(4), E(5), A(6). Now, let us count shorter figures to the left for each position:
- For F(0): No figures are to its left. So, 0 shorter figures.
- For D(1): Figure to its left is F(0). F(0) is shorter than D(1). So, 1 shorter figure.
- For B(2): Figures to its left are F(0), D(1). Both are shorter than B(2). So, 2 shorter figures.
- For G(3): Figures to its left are F(0), D(1), B(2). All are shorter than G(3). So, 3 shorter figures.
- For C(4): Figures to its left are F(0), D(1), B(2), G(3). All are shorter than C(4). So, 4 shorter figures.
- For E(5): Figures to its left are F(0), D(1), B(2), G(3), C(4). All are shorter than E(5). So, 5 shorter figures.
- For A(6): Figures to its left are F(0), D(1), B(2), G(3), C(4), E(5). All are shorter than A(6). So, 6 shorter figures. The sequence obtained is 0, 1, 2, 3, 4, 5, 6. This matches the given sequence.
Step 5 — Verify arrangement for (d) 0, 1, 0, 1, 0, 1, 0
The required arrangement is EAGCDBF. Let us list the figures in this order with their heights: E(5), A(6), G(3), C(4), D(1), B(2), F(0). Now, let us count shorter figures to the left for each position:
- For E(5): No figures are to its left. So, 0 shorter figures.
- For A(6): Figure to its left is E(5). E(5) is shorter than A(6). So, 1 shorter figure.
- For G(3): Figures to its left are E(5), A(6). Both are taller than G(3). So, 0 shorter figures.
- For C(4): Figures to its left are E(5), A(6), G(3). G(3) is shorter than C(4). E(5) and A(6) are taller. So, 1 shorter figure.
- For D(1): Figures to its left are E(5), A(6), G(3), C(4). All are taller than D(1). So, 0 shorter figures.
- For B(2): Figures to its left are E(5), A(6), G(3), C(4), D(1). D(1) is shorter than B(2). Others are taller. So, 1 shorter figure.
- For F(0): Figures to its left are E(5), A(6), G(3), C(4), D(1), B(2). All are taller than F(0). So, 0 shorter figures. The sequence obtained is 0, 1, 0, 1, 0, 1, 0. This matches the given sequence.
Step 6 — Verify arrangement for (e) 0, 1, 1, 1, 1, 1, 1
The required arrangement is FAECGBD. Let us list the figures in this order with their heights: F(0), A(6), E(5), C(4), G(3), B(2), D(1). Now, let us count shorter figures to the left for each position:
- For F(0): No figures are to its left. So, 0 shorter figures.
- For A(6): Figure to its left is F(0). F(0) is shorter than A(6). So, 1 shorter figure.
- For E(5): Figures to its left are F(0), A(6). F(0) is shorter than E(5). A(6) is taller. So, 1 shorter figure.
- For C(4): Figures to its left are F(0), A(6), E(5). F(0) is shorter than C(4). A(6) and E(5) are taller. So, 1 shorter figure.
- For G(3): Figures to its left are F(0), A(6), E(5), C(4). F(0) is shorter than G(3). A(6), E(5), C(4) are taller. So, 1 shorter figure.
- For B(2): Figures to its left are F(0), A(6), E(5), C(4), G(3). F(0) is shorter than B(2). Others are taller. So, 1 shorter figure.
- For D(1): Figures to its left are F(0), A(6), E(5), C(4), G(3), B(2). F(0) is shorter than D(1). Others are taller. So, 1 shorter figure. The sequence obtained is 0, 1, 1, 1, 1, 1, 1. This matches the given sequence.
Step 7 — Verify arrangement for (f) 0, 0, 0, 3, 3, 3, 3
The required arrangement is BDFAECG. Let us list the figures in this order with their heights: B(2), D(1), F(0), A(6), E(5), C(4), G(3). Now, let us count shorter figures to the left for each position:
- For B(2): No figures are to its left. So, 0 shorter figures.
- For D(1): Figure to its left is B(2). B(2) is taller than D(1). So, 0 shorter figures.
- For F(0): Figures to its left are B(2), D(1). Both are taller than F(0). So, 0 shorter figures.
- For A(6): Figures to its left are B(2), D(1), F(0). All are shorter than A(6). So, 3 shorter figures.
- For E(5): Figures to its left are B(2), D(1), F(0), A(6). B(2), D(1), F(0) are shorter than E(5). A(6) is taller. So, 3 shorter figures.
- For C(4): Figures to its left are B(2), D(1), F(0), A(6), E(5). B(2), D(1), F(0) are shorter than C(4). A(6) and E(5) are taller. So, 3 shorter figures.
- For G(3): Figures to its left are B(2), D(1), F(0), A(6), E(5), C(4). B(2), D(1), F(0) are shorter than G(3). A(6), E(5), C(4) are taller. So, 3 shorter figures. The sequence obtained is 0, 0, 0, 3, 3, 3, 3. This matches the given sequence.
Answer
(a) The required arrangement is FCBGADE. (b) The required arrangement is AECGBDF. (c) The required arrangement is FDBGCEA. (d) The required arrangement is EAGCDBF. (e) The required arrangement is FAECGBD. (f) The required arrangement is BDFAECG.
More questions in FIO
Arrange the stick figure cutouts given at the end of the book or draw a height arrangement such that the sequence reads:
(a) 0, 1, 1, 2, 4, 1, 5
(b) 0, 0, 0, 0, 0, 0, 0
(c) 0, 1, 2, 3, 4, 5, 6
(d) 0, 1, 0, 1, 0, 1, 0
(e) 0, 1, 1, 1, 1, 1, 1
(f) 0, 0, 0, 3, 3, 3, 3
For each of the statements given below, think and identify if it is Always True, Only Sometimes True, or Never True. Share your reasoning.
(a) If a person says '0', then they are the tallest in the group.
(b) If a person is the tallest, then their number is '0'.
(c) The first person's number is '0'.
(d) If a person is not first or last in line (i.e., if they are standing somewhere in between), then they cannot say '0'.
(e) The person who calls out the largest number is the shortest.
(f) What is the largest number possible in a group of 8 people?
Using your understanding of the pictorial representation of odd and even numbers, find out the parity of the following sums:
(a) Sum of 2 even numbers and 2 odd numbers (e.g., even + even + odd + odd)
(b) Sum of 2 odd numbers and 3 even numbers
(c) Sum of 5 even numbers
(d) Sum of 8 odd numbers
Lakpa has an odd number of ₹1 coins, an odd number of ₹5 coins and an even number of ₹10 coins in his piggy bank. He calculated the total and got ₹205. Did he make a mistake? If he did, explain why. If he didn't, how many coins of each type could he have?
We know that:
(a) even + even = even
(b) odd + odd = even
(c) even + odd = odd
Similarly, find out the parity for the scenarios below:
(d) even - even = _________
(e) odd - odd = _________
(f) even - odd = _________
(g) odd - even = _________
How many different magic squares can be made using the numbers 1 – 9?
Create a magic square using the numbers 2 – 10. What strategy would you use for this? Compare it with the magic squares made using 1 – 9.
Take a magic square, and
(a) increase each number by 1
(b) double each number
In each case, is the resulting grid also a magic square? How do the magic sums change in each case?
What other operations can be performed on a magic square to yield another magic square?
Discuss ways of creating a magic square using any set of 9 consecutive numbers (like 2 – 10, 3 – 11, 9 – 17, etc.).
Using this generalised form, find a magic square if the centre number is 25.
What is the expression obtained by adding the 3 terms of any row, column or diagonal?
Write the result obtained by— (a) adding 1 to every term in the generalised form. (b) doubling every term in the generalised form
Create a magic square whose magic sum is 60.
Is it possible to get a magic square by filling nine non-consecutive numbers?
A light bulb is ON. Dorjee toggles its switch 77 times. Will the bulb be on or off? Why?
Liswini has a large old encyclopaedia. When she opened it, several loose pages fell out of it. She counted 50 sheets in total, each printed on both sides. Can the sum of the page numbers of the loose sheets be 6000? Why or why not?
Here is a 2 × 3 grid. For each row and column, the parity of the sum is written in the circle; 'e' for even and 'o' for odd. Fill the 6 boxes with 3 odd numbers ('o') and 3 even numbers ('e') to satisfy the parity of the row and column sums.
Make a 3 × 3 magic square with 0 as the magic sum. All numbers can not be zero. Use negative numbers, as needed.
Fill in the following blanks with 'odd' or 'even':
(a) Sum of an odd number of even numbers is ______
(b) Sum of an even number of odd numbers is ______
(c) Sum of an even number of even numbers is ______
(d) Sum of an odd number of odd numbers is ______
What is the parity of the sum of the numbers from 1 to 100?
Two consecutive numbers in the Virahāṅka sequence are 987 and 1597. What are the next 2 numbers in the sequence? What are the previous 2 numbers in the sequence?
Angaan wants to climb an 8-step staircase. His playful rule is that he can take either 1 step or 2 steps at a time. For example, one of his paths is 1, 2, 2, 1, 2. In how many different ways can he reach the top?
What is the parity of the 20th term of the Virahāṅka sequence?
Identify the statements that are true.
(a) The expression always gives odd numbers. (b) All even numbers can be expressed as . (c) Both expressions and describe all odd numbers. (d) The expression gives both even and odd numbers.
Solve this cryptarithm: