SOLVER7 Study. Nothing Else.
Exercise 8.2 Q23

If the first and the nth term of a \(G.P.\) are \(a\) and \(b,\) respectively, and if \(P\) is the product of \(n\) terms, prove that \(P^2 = (ab)^n.\)

CBSE Class 11 Maths · Sequences and Series

Solution

👶 Simple Explanation

Simple Explanation

Imagine a staircase where each step is a certain number of times taller than the one before. A geometric progression works just like that. When you multiply all the steps together, the powers of the common ratio pair up in a balanced way — the first and last, the second and second-to-last, and so on. Each pair gives the same product as multiplying the first and last terms. So the big product squared equals that pair product repeated for every term, which is exactly what we prove here.

Answer: Since \( P = a^{n} r^{\frac{n(n-1)}{2}} \) gives \( P^2 = a^{2n} r^{n(n-1)} \), and \( (ab)^n = a^{2n} r^{n(n-1)} \), we conclude \[ P^2 = (ab)^n. \]

📖 Product of n terms of a G.P. equals (ab)^n raised to half

Detailed Explanation

In a geometric progression (G.P.), each term is obtained by multiplying the previous term by a fixed number called the common ratio \( r \). If the first term is \( a \), then the terms are \( a, ar, ar^2, \ldots, ar^{n-1} \). Here the first term is \( a \) and the last (nth) term is \( b \), so \( b = ar^{n-1} \). The key idea in this proof is that when we multiply all n terms together, the powers of \( r \) add up in a neat way, and this sum can be linked to the product of the first and last terms. This uses the same symmetry that gives the well-known formula for the sum of an arithmetic series.

Formula Used

nth term of a G.P.: \( a_n = a r^{n-1} \). Sum of first \( (n-1) \) whole numbers: \( 0 + 1 + 2 + \cdots + (n-1) = \dfrac{(n-1)n}{2} \).

Solution

  1. Step 1: Write down the terms of the G.P. With first term \( a \) and common ratio \( r \), the n terms are \[ a,\ ar,\ ar^2,\ \ldots,\ ar^{n-1}. \] The last (nth) term is given to be \( b \), so \( b = a r^{n-1} \).
  2. Step 2: Form the product P of all n terms by multiplying them together: \[ P = a \cdot ar \cdot ar^2 \cdots ar^{n-1}. \] There are n factors, each containing a single \( a \).
  3. Step 3: Collect the \( a \) factors and the \( r \) factors separately. Since \( a \) appears n times, \[ P = a^{n} \cdot r^{\,0+1+2+\cdots+(n-1)}. \] The exponent of \( r \) is the sum of \( 0, 1, 2, \ldots, (n-1) \).
  4. Step 4: Use the sum formula \( 0 + 1 + 2 + \cdots + (n-1) = \dfrac{(n-1)n}{2} \). Substituting this into the exponent of \( r \): \[ P = a^{n} \cdot r^{\frac{n(n-1)}{2}}. \]
  5. Step 5: Square both sides so the fractional-looking exponent becomes a whole-number power that we can compare easily: \[ P^2 = a^{2n} \cdot r^{\,n(n-1)}. \] Here \( \left( r^{\frac{n(n-1)}{2}} \right)^2 = r^{n(n-1)}. \)
  6. Step 6: Now compute \( (ab)^n \) using \( b = a r^{n-1} \). We get \[ ab = a \cdot a r^{n-1} = a^2 r^{n-1}. \] Raising to the power n gives \[ (ab)^n = \left( a^2 r^{n-1} \right)^n = a^{2n} r^{n(n-1)}. \]
  7. Step 7: Compare the two results. From Step 5, \( P^2 = a^{2n} r^{n(n-1)} \), and from Step 6, \( (ab)^n = a^{2n} r^{n(n-1)} \). Both are identical, hence \[ P^2 = (ab)^n. \]

Final Answer

Since \( P = a^{n} r^{\frac{n(n-1)}{2}} \) gives \( P^2 = a^{2n} r^{n(n-1)} \), and \( (ab)^n = a^{2n} r^{n(n-1)} \), we conclude \[ P^2 = (ab)^n. \]

Common Mistake

A common mistake is to compute the exponent of \( r \) as \( 1 + 2 + \cdots + n = \dfrac{n(n+1)}{2} \). The powers of \( r \) actually start from \( 0 \) (the first term \( a = ar^0 \)) and go up to \( n-1 \), so the correct sum is \( \dfrac{n(n-1)}{2} \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: List all \( n \) terms of the G.P. with first term \( a \) and common ratio \( r \): \[ a,\ ar,\ ar^2,\ \ldots,\ ar^{n-1} \] The last term equals \( b \), so \( b = ar^{n-1} \). — Reason: Explicitly writing every term makes it easy to see what gets multiplied together.
  2. Step 2: Define \( P \) as the product of all \( n \) terms: \[ P = a \cdot ar \cdot ar^2 \cdots ar^{n-1} \] — Reason: Setting up the product \( P \) is the starting point for what we need to prove.
  3. Step 3: Separate the powers of \( a \) and the powers of \( r \). Since \( a \) appears exactly \( n \) times and the exponents of \( r \) run from \( 0 \) to \( n-1 \): \[ P = a^{n} \cdot r^{\,0+1+2+\cdots+(n-1)} \] — Reason: Grouping like bases together allows us to apply the exponent addition law cleanly.
  4. Step 4: Apply the integer sum formula to the exponent of \( r \): \[ 0 + 1 + 2 + \cdots + (n-1) = \frac{n(n-1)}{2} \] So the product becomes \[ P = a^{n} r^{\frac{n(n-1)}{2}} \] — Reason: This classic arithmetic series result simplifies the messy exponent into a single compact expression.
  5. Step 5: Square both sides of \( P = a^{n} r^{\frac{n(n-1)}{2}} \) to get \[ P^2 = a^{2n} r^{n(n-1)} \] — Reason: Squaring is the natural move because the target expression \( (ab)^n \) will also be of degree \( 2n \) in \( a \), making both sides comparable.
  6. Step 6: Now compute \( (ab)^n \) using \( b = ar^{n-1} \): \[ (ab)^n = \left(a \cdot ar^{n-1}\right)^n = \left(a^2 r^{n-1}\right)^n = a^{2n} r^{n(n-1)} \] — Reason: Substituting the expression for \( b \) lets us write \( (ab)^n \) purely in terms of \( a \) and \( r \) so we can directly compare it to \( P^2 \).
  7. Step 7: Observe that both \( P^2 \) and \( (ab)^n \) equal \( a^{2n} r^{n(n-1)} \). Therefore \[ P^2 = (ab)^n \] — Reason: Since the two expressions are identical, the equality is established and the proof is complete.

Final Answer

Since \( P = a^{n} r^{\frac{n(n-1)}{2}} \) gives \( P^2 = a^{2n} r^{n(n-1)} \), and \( (ab)^n = a^{2n} r^{n(n-1)} \), we conclude \[ P^2 = (ab)^n. \]

Common Mistake

One common mistake: forgetting that the exponents of \( r \) in the product start at \( 0 \) (not \( 1 \)), so students may write the sum as \( 1 + 2 + \cdots + (n-1) = \frac{n(n-1)}{2} - 1 \) instead of the correct \( 0 + 1 + \cdots + (n-1) = \frac{n(n-1)}{2} \), leading to a wrong exponent for \( r \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Product of all n terms: \[ P = a \cdot ar \cdot ar^2 \cdots ar^{n-1} = a^{n} \cdot r^{0+1+2+\cdots+(n-1)} \]
  2. Step 2: Apply sum formula \( 0 + 1 + \cdots + (n-1) = \dfrac{n(n-1)}{2} \) to get \[ P = a^{n}\, r^{\frac{n(n-1)}{2}} \]
  3. Step 3: Square both sides: \( P^2 = a^{2n}\, r^{n(n-1)} \). Also, \( (ab)^n = (a \cdot ar^{n-1})^n = a^{2n}\, r^{n(n-1)} \).

Answer: Since \( P = a^{n} r^{\frac{n(n-1)}{2}} \) gives \( P^2 = a^{2n} r^{n(n-1)} \), and \( (ab)^n = a^{2n} r^{n(n-1)} \), we conclude \[ P^2 = (ab)^n. \]

➕ More Examples

More Examples

Example 1

Question: The first term of a G.P. is \( c \) and its last (i.e., \( n \)-th) term is \( d \). If \( Q \) denotes the product of all \( n \) terms of the G.P., prove that \( Q^2 = (cd)^n \).

Solution: Let the G.P. have first term \( c \), common ratio \( r \), and \( n \) terms. The \( n \)-th (last) term is given by: \[ d = c \cdot r^{n-1} \] So we have: \[ r^{n-1} = \frac{d}{c} \] The product of all \( n \) terms is: \[ Q = c \cdot (cr) \cdot (cr^2) \cdots (cr^{n-1}) \] Grouping the \( c \) terms and the \( r \) terms separately: \[ Q = c^n \cdot r^{0+1+2+\cdots+(n-1)} \] Using the formula for the sum of the first \( (n-1) \) natural numbers: \[ Q = c^n \cdot r^{\frac{n(n-1)}{2}} \] Now squaring both sides: \[ Q^2 = c^{2n} \cdot r^{n(n-1)} \] This can be rewritten as: \[ Q^2 = \left( c^2 \cdot r^{n-1} \right)^n \] Since \( r^{n-1} = \frac{d}{c} \), substituting: \[ Q^2 = \left( c^2 \cdot \frac{d}{c} \right)^n \] Simplifying inside the bracket: \[ Q^2 = (cd)^n \] Hence proved.

Answer: \( Q^2 = (cd)^n \)

Example 2

Question: A G.P. has its first term equal to \( p \) and its \( m \)-th term equal to \( q \). If \( R \) is the product of all \( m \) terms of the G.P., prove that \( R^2 = (pq)^m \).

Solution: Let the G.P. have first term \( p \), common ratio \( r \), and \( m \) terms. The \( m \)-th term is: \[ q = p \cdot r^{m-1} \] Therefore: \[ r^{m-1} = \frac{q}{p} \] The product of all \( m \) terms is: \[ R = p \cdot (pr) \cdot (pr^2) \cdots (pr^{m-1}) \] Separating powers of \( p \) and \( r \): \[ R = p^m \cdot r^{0+1+2+\cdots+(m-1)} \] Using the arithmetic series sum formula: \[ R = p^m \cdot r^{\frac{m(m-1)}{2}} \] Squaring both sides: \[ R^2 = p^{2m} \cdot r^{m(m-1)} \] Factoring the right-hand side as an \( m \)-th power: \[ R^2 = \left( p^2 \cdot r^{m-1} \right)^m \] Substituting \( r^{m-1} = \frac{q}{p} \): \[ R^2 = \left( p^2 \cdot \frac{q}{p} \right)^m \] Simplifying: \[ R^2 = (pq)^m \] Hence proved.

Answer: \( R^2 = (pq)^m \)

🎯 Try a Similar Question

Try a Similar Question

Question: The first term of a G.P. is \( a \) and its last (n-th) term is \( c \). If \( Q \) denotes the product of all n terms of this G.P., prove that \( Q^2 = (ac)^n \).

Solution

  1. Step 1: Write the terms of the G.P.: Let the G.P. have first term \( a \) and common ratio \( r \). The n terms are \( a,\; ar,\; ar^2,\; \ldots,\; ar^{n-1} \). The last (n-th) term is \( c = ar^{n-1} \).
  2. Step 2: Express the product Q of all n terms.: The product of all n terms is \[ Q = a \cdot ar \cdot ar^2 \cdots ar^{n-1}. \] This equals \[ Q = a^n \cdot r^{0+1+2+\cdots+(n-1)}. \] The exponent of \( r \) is the sum \( 0 + 1 + 2 + \cdots + (n-1) = \frac{n(n-1)}{2} \). Therefore, \[ Q = a^n \cdot r^{\frac{n(n-1)}{2}}. \]
  3. Step 3: Compute Q squared.: Squaring both sides of the expression for \( Q \): \[ Q^2 = \left( a^n \cdot r^{\frac{n(n-1)}{2}} \right)^2 = a^{2n} \cdot r^{n(n-1)}. \]
  4. Step 4: Compute (ac)^n.: Since \( c = ar^{n-1} \), we have \[ (ac)^n = \left( a \cdot ar^{n-1} \right)^n = \left( a^2 r^{n-1} \right)^n = a^{2n} \cdot r^{n(n-1)}. \]
  5. Step 5: Compare the two expressions.: From Steps 3 and 4, both \( Q^2 \) and \( (ac)^n \) equal \( a^{2n} \cdot r^{n(n-1)} \). Therefore, \[ Q^2 = (ac)^n. \] This completes the proof.

Answer: Since \( Q = a^n r^{\frac{n(n-1)}{2}} \), we get \( Q^2 = a^{2n} r^{n(n-1)} \). Also, using \( c = ar^{n-1} \), we get \( (ac)^n = a^{2n} r^{n(n-1)} \). Hence \[ Q^2 = (ac)^n. \]

Everything you get with Solver7

More questions in Sequences and Series