Home
Class 11
MATHS
For all n inN,3*5^(2n+1)+2^(3n+1) is div...

For all n `inN,3*5^(2n+1)+2^(3n+1)` is divisible by (A) 19 (B) 17 (C) 23 (D) 25

A

19

B

17

C

23

D

25

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem, we need to show that \( P(n) = 3 \cdot 5^{2n+1} + 2^{3n+1} \) is divisible by a certain number for all natural numbers \( n \). We will check the values of \( P(n) \) for \( n = 1 \) and \( n = 2 \) and then find the highest common factor (HCF) of these two results to determine the number that divides both. ### Step-by-Step Solution: 1. **Define the Expression**: We have \( P(n) = 3 \cdot 5^{2n+1} + 2^{3n+1} \). 2. **Calculate \( P(1) \)**: \[ P(1) = 3 \cdot 5^{2 \cdot 1 + 1} + 2^{3 \cdot 1 + 1} \] \[ = 3 \cdot 5^{3} + 2^{4} \] \[ = 3 \cdot 125 + 16 \] \[ = 375 + 16 = 391 \] 3. **Calculate \( P(2) \)**: \[ P(2) = 3 \cdot 5^{2 \cdot 2 + 1} + 2^{3 \cdot 2 + 1} \] \[ = 3 \cdot 5^{5} + 2^{7} \] \[ = 3 \cdot 3125 + 128 \] \[ = 9375 + 128 = 9503 \] 4. **Find the HCF of \( P(1) \) and \( P(2) \)**: We need to find the highest common factor of \( 391 \) and \( 9503 \). - **Prime Factorization of 391**: - \( 391 = 17 \times 23 \) - **Prime Factorization of 9503**: - \( 9503 = 17 \times 559 \) (where \( 559 = 13 \times 43 \)) The common factor is \( 17 \). 5. **Conclusion**: Since both \( P(1) \) and \( P(2) \) are divisible by \( 17 \), we conclude that \( P(n) \) is divisible by \( 17 \) for all natural numbers \( n \). ### Final Answer: The correct option is (B) 17.

To solve the problem, we need to show that \( P(n) = 3 \cdot 5^{2n+1} + 2^{3n+1} \) is divisible by a certain number for all natural numbers \( n \). We will check the values of \( P(n) \) for \( n = 1 \) and \( n = 2 \) and then find the highest common factor (HCF) of these two results to determine the number that divides both. ### Step-by-Step Solution: 1. **Define the Expression**: We have \( P(n) = 3 \cdot 5^{2n+1} + 2^{3n+1} \). 2. **Calculate \( P(1) \)**: ...
Promotional Banner

Topper's Solved these Questions

  • PRINCIPLE OF MATHEMATICAL INDUCTION

    NCERT EXEMPLAR ENGLISH|Exercise LONG ANSWER TYPE QUESTION|9 Videos
  • PERMUTATIONS AND COMBINATIONS

    NCERT EXEMPLAR ENGLISH|Exercise Matching The Columns|5 Videos
  • PROBABILITY

    NCERT EXEMPLAR ENGLISH|Exercise Matching The Columns|2 Videos

Similar Questions

Explore conceptually related problems

For all n in N, 3.5^(2n+1) + 2^(3n+1) is divisible by: (i) 17 (ii) 19 (iii) 23 (iv) 25

For all n in N, 3^(3n)-26^(n)-1 is divisible by

For all n in N , 3xx5^(2n+1)+2^(3n+1) is divisible by a. 19 b. 17 c. 23 d. 25

For all n in N, 3n^(5) + 5n^(3) + 7n is divisible by

For all n in N, 2^(n+1) + 3^(2n-1) is divisible by: (i) 5 (ii) 7 (iii) 14 (iv) 135

For all n in N, 7^(2n)-48n-1 is divisible by

For all n in N , 4^(n)-3n-1 is divisible by

For each n in N, 3^(2n)-1 is divisible by

For all n in N, n^(3)+2n is divisible by

Integer just greater tehn (sqrt(3)+1)^(2n) is necessarily divisible by (A) n+2 (B) 2^(n+3) (C) 2^n (D) 2^(n+1)