NCERT Solutions · Class 9 Maths · Ganita Manjari Part II · Chapter 9
Chapter 9: Propositions and their Converses (Propositions)
Step-by-step solutions to all 17 questions of Exercise Set 9.1 of Ganita Manjari Part II Chapter 9 (NCERT Class 9 Maths, 2026-27): framing converses, deciding whether each statement is true, proofs and counterexamples. All 17 questions are answered, with the key answer highlighted.
For "If X, then Y", the converse is "If Y, then X". To show a statement is true we must give a reason that works in every case; to show it is false, one counterexample is enough.
Exercise Set 9.1
Questions 1 to 12: frame the converse of each proposition, decide whether each of the two statements is true, justify the true ones and give a counterexample for each false one.
If two lines are parallel, then the corresponding angles formed by a transversal are equal.
Solution
Converse: If the corresponding angles formed by a transversal with two lines are equal, then the lines are parallel.
Proposition: true. This is the corresponding angles property of parallel lines (studied in earlier grades).
Converse: true. If the lines were not parallel, they would meet on one side of the transversal and form a triangle; then one of the "corresponding" angles would be an exterior angle of that triangle and would be greater than the other, contradicting equality. So equal corresponding angles force the lines to be parallel.
If a quadrilateral is a square, then all its angles are equal.
Solution
Converse: If all the angles of a quadrilateral are equal, then it is a square.
Proposition: true. All angles of a square are 90°.
Converse: false. Counterexample: a rectangle with sides 4 cm and 2 cm has all four angles equal to 90°, but it is not a square. (Equal angles force each angle to be 360° ÷ 4 = 90°, so the quadrilateral is a rectangle, but its sides need not be equal.)
Proposition true; converse false (a non-square rectangle).
Given any △ABC, let us bisect the angles at B and C. The bisectors meet at the incentre I of the triangle. Now extend the bisectors beyond I till they meet the opposite sides at E and F respectively, as shown (Fig. 9.1). Proposition: If AB = AC, then IE = IF.
Solution
Here E is on AC (on the bisector from B) and F is on AB (on the bisector from C).
Converse: If IE = IF, then AB = AC.
Proposition: true. If AB = AC then ∠B = ∠C, so their halves are equal: ∠IBC=∠ICB, and therefore IB = IC. Now compare △IBF and △ICE:
∠IBF=21∠B=21∠C=∠ICE
IB=IC
∠BIF=∠CIE (vertically opposite angles, since BIE and CIF are straight lines)
So △IBF≅△ICE (ASA), and hence IF = IE.
Converse: false. Write ∠B=2β, ∠C=2γ and let r be the inradius. In △ICE, ∠ICE=γ and ∠CIE=β+γ (the exterior angle of △IBC at I), so ∠IEC=180°−(β+2γ). Dropping the perpendicular from I to AC (length r) gives IE=sin(β+2γ)r; in the same way IF=sin(2β+γ)r. These are equal when β=γ, but also when (β+2γ)+(2β+γ)=180°, i.e. β+γ=60°, i.e. ∠A=60°.
Counterexample: take ∠A = 60°, ∠B = 80°, ∠C = 40°. Then IE = IF (measuring, or by the formula: sin100°=sin80°), but AB ≠ AC, because ∠B ≠ ∠C.
∠A = 60°, ∠B = 80°, ∠C = 40°: IE = IF, yet AB ≠ AC
Proposition true (ASA congruence of △IBF and △ICE). Converse false: any triangle with ∠A = 60° and ∠B ≠ ∠C (e.g. 60°, 80°, 40°) has IE = IF but AB ≠ AC.
If x = y, then x³ = y³. (x and y are real numbers.)
Solution
Converse: If x³ = y³, then x = y.
Proposition: true. Equal numbers have equal cubes.
Converse: true. x3−y3=(x−y)(x2+xy+y2), and x2+xy+y2=(x+2y)2+43y2, which is positive unless x = y = 0. So if x3=y3, the product is 0 and therefore x − y = 0. (Unlike squares, cubes keep the sign: there is no "−2" problem.)
If n is divisible by 24, then it is divisible by both 4 and 6. (n is a positive integer.)
Solution
Converse: If n is divisible by both 4 and 6, then it is divisible by 24.
Proposition: true. If n = 24k, then n = 4(6k) = 6(4k).
Converse: false. Counterexample: n = 12 is divisible by 4 and by 6, but not by 24. (Being divisible by 4 and 6 only means being divisible by their LCM, 12.)
If n is divisible by 60, then it is divisible by both 5 and 12.
Solution
Converse: If n is divisible by both 5 and 12, then it is divisible by 60.
Proposition: true. If n = 60k, then n = 5(12k) = 12(5k).
Converse: true. If 12 divides n, then n = 12k. Since 5 divides 12k and 5 has no common factor with 12, 5 must divide k, say k = 5m. Then n = 60m. (The LCM of 5 and 12 is 60.)
Both are true (5 and 12 have no common factor, so LCM = 60).
If n is the square of a prime number, then it has exactly 3 factors.
Solution
Converse: If n has exactly 3 factors, then it is the square of a prime number.
Proposition: true. If n=p2 (p prime), its factors are exactly 1, p and p2.
Converse: true. Factors come in partner pairs (d and n/d). With an odd number of factors, one factor must be its own partner, so n is a perfect square, n=d2, and the three factors are 1, d, d2. If d were not prime, say d = ab with 1 < a < d, then a would be a fourth factor of n. So d is prime.
If n is a product of two unequal prime numbers, then it has exactly 4 divisors.
Solution
Converse: If n has exactly 4 divisors, then it is a product of two unequal prime numbers.
Proposition: true. If n = pq with p ≠ q primes, its divisors are exactly 1, p, q and pq.
Converse: false. Counterexample: n = 8 = 2³ has exactly 4 divisors (1, 2, 4, 8), but it is not a product of two unequal primes. (Every cube of a prime, p3, is a counterexample.)
If n and n + 3 have no factors in common, then n is not a multiple of 3.
Solution
("No factors in common" means no common factor other than 1.)
Converse: If n is not a multiple of 3, then n and n + 3 have no factors in common.
Proposition: true. If n were a multiple of 3, then n + 3 would also be a multiple of 3, and 3 would be a common factor.
Converse: true. Any common factor d of n and n + 3 divides their difference, 3. So d = 1 or d = 3. If n is not a multiple of 3, d cannot be 3, so d = 1.
Both are true: n and n + 3 share a factor other than 1 exactly when 3 divides n.
There are no known 'neat' expressions that generate only primes! Find counterexamples to the following claims. (i) All numbers of the form 4n² + 1 are prime. (ii) All numbers of the form n² + n + 11 are prime. (iii) All numbers of the form 4ⁿ + 3 are prime.
Solution
(i) n = 1, 2, 3 give 5, 17, 37 (all prime), but n = 4 gives 4×16+1=65=5×13.
(ii) n = 0 to 9 give 11, 13, 17, 23, 31, 41, 53, 67, 83, 101 (all prime), but n = 10 gives 100+10+11=121=11×11.
(iii) n = 1, 2, 3 give 7, 19, 67 (all prime), but n = 4 gives 256+3=259=7×37. (Also n = 0 gives 4.)
(i) n = 4: 65 = 5 × 13 (ii) n = 10: 121 = 11² (iii) n = 4: 259 = 7 × 37
Find counterexamples to the following statements. (i) If n is a prime number, then 2ⁿ − 1 is a prime number. (ii) If n is an even number, then 2ⁿ + 1 is a prime number.
Solution
(i) For n = 2, 3, 5, 7 we get 3, 7, 31, 127 (all prime). But n = 11 is prime and 211−1=2047=23×89.
(ii) n = 2 gives 5 and n = 4 gives 17 (prime). But n = 6 is even and 26+1=65=5×13.
(i) n = 11: 2047 = 23 × 89 (ii) n = 6: 65 = 5 × 13
Consider the statement: 'If a number is divisible by 8, then it is divisible by both 2 and 4'. (i) Justify the statement. (ii) Recall the divisibility shortcuts that we have studied for different numbers. To check whether a given number is divisible by 8, is it enough to check whether it is divisible by 2 and 4? Why or why not?
Solution
(i) If n = 8k, then n = 2(4k) and n = 4(2k), so n is divisible by both 2 and 4.
(ii) No. That would be using the converse, which is false. Divisible by 2 and 4 means divisible by 4 (any multiple of 4 is already even), and not every multiple of 4 is a multiple of 8. Counterexample: 12 is divisible by 2 and 4 but not by 8. The correct shortcut for 8 is: check whether the number formed by the last three digits is divisible by 8.
(i) 8k = 2(4k) = 4(2k). (ii) No; for example 12 passes the test for 2 and 4 but is not divisible by 8. Use the last-three-digits test instead.
Recall that a shortcut to check whether a given number is divisible by 3 is to add the digits of the number and check if the sum is a multiple of 3. Express the relationship between 'a number is divisible by 3' and 'sum of the digits is a multiple of 3' using 'If-then' sentences.
Solution
Both directions are true, so we need two sentences:
If a number is divisible by 3, then the sum of its digits is a multiple of 3.
If the sum of the digits of a number is a multiple of 3, then the number is divisible by 3.
Together: a number is divisible by 3 if and only if the sum of its digits is a multiple of 3. (Reason: a number differs from its digit sum by a multiple of 9, e.g. 372−(3+7+2)=3×99+7×9, so both are multiples of 3 or neither is.)
"If a number is divisible by 3, then its digit sum is a multiple of 3" and its converse "If the digit sum is a multiple of 3, then the number is divisible by 3" are both true.
Suppose we have identified a category of quadrilaterals called Q, and we have to construct a quadrilateral of this type using two thin sticks put together as diagonals (Fig. 9.2). (i) Suppose Q satisfies the property: If a quadrilateral is of type Q, then it has equal-length diagonals. (a) Should the two sticks be of equal length? Why or why not? (b) Will it matter how the two sticks are put together? (ii) Instead, suppose Q satisfies the property: If a quadrilateral has equal diagonals, then it is of type Q. What will be your answers to (a) and (b) now?
Solution
(i) "Q ⇒ equal diagonals".
(a) Yes. Every quadrilateral of type Q has equal diagonals, so with unequal sticks we can never get a Q.
(b) It may matter. Equal diagonals are necessary, but this property does not say they are enough. For example, if Q were "rectangles", the sticks would also have to bisect each other; if Q were "squares", they would have to bisect each other at right angles. So we cannot just place equal sticks anyhow.
(ii) "Equal diagonals ⇒ Q".
(a) Equal sticks are enough: any quadrilateral with equal diagonals is a Q, so using equal sticks guarantees success. (The property does not forbid other Q's with unequal diagonals, but equal sticks are the safe choice.)
(b) It does not matter how the equal sticks are put together (as long as their ends form a quadrilateral): every such quadrilateral has equal diagonals and is therefore of type Q.
This question shows the difference between a proposition and its converse: in (i), equal diagonals are a necessary condition; in (ii), they are a sufficient condition.
(i) (a) Yes, they must be equal (b) Yes, the arrangement may matter. (ii) (a) Equal sticks guarantee a Q (b) The arrangement does not matter.