All Exams Test series for 1 year @ ₹349 only
Question

Let P(n) = 32n + 1 + 2n + 2 where n ∈ ℕ. Then

The correct answer is

there exists prime integer which divides P(n).

Divisibility of an expression like this is checked with modular arithmetic: rewrite the powers so that a common base appears and reduce modulo a suitable prime.

Step 1 — Write \(P(n) = 3\cdot 9^{n} + 4\cdot 2^{n}\).

Step 2 — Since \(9 \equiv 2 \pmod 7\), \(P(n) \equiv 3\cdot 2^{n} + 4\cdot 2^{n} = 7\cdot 2^{n} \equiv 0 \pmod 7\). So the prime 7 divides P(n) for every natural n; there certainly exists a prime dividing P(n).

Step 3 — Check the other statements: P(1) = 27 + 8 = 35 and P(2) = 243 + 16 = 259 = 7 × 37. 259 is not divisible by 5, so divisibility by 5 for all n fails.

Step 4 — \(3^{2n+1}\) is a multiple of 3 while \(2^{n+2}\) is not, so P(n) is never divisible by 3. And P(n) > 1, so it always has some prime factor; the claim that no prime divides it is false.

there exists prime integer which divides P(n). option is correct.

Was this answer helpful?

Similar Questions

  1. A letter lock consists of three rings with 15 different letters. If N denotes the number of ways in which it is possible to make unsuccessful attempts to open the lock, then

  2. If z1 and z2 are two complex numbers satisfying the equation \(\left|\dfrac{z_1 + z_2}{z_1 - z_2}\right| = 1\), then \(\dfrac{z_1}{z_2}\) may be

  3. If R and R1 are equivalence relations on a set A, then so are the relations

  4. Let a1, a2, a3, …, an be positive real numbers. Then the minimum value of

    \(\dfrac{a_1}{a_2} + \dfrac{a_2}{a_3} + \ldots + \dfrac{a_n}{a_1}\) is

  5. Consider a quadratic equation ax2 + 2bx + c = 0 where a, b, c are positive real numbers. If the equation has no real root, then which of the following is true ?

  6. Let A = \(\begin{pmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}\), B = \(\begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}\) and P = \(\begin{pmatrix} 0 & 1 & 0 \\ x & 0 & 0 \\ 0 & 0 & y \end{pmatrix}\) be an orthogonal matrix such that B = PAP−1 holds. Then

  7. Let ρ be a relation defined on set of natural numbers ℕ, as ρ = \(\{(x, y) \in \mathbb{N} \times \mathbb{N} : 2x + y = 41\}\). Then domain A and range B are

  8. Let A and B are orthogonal matrices and det A + det B = 0. Then

  9. Let A be a set containing n elements. A subset P of A is chosen, and the set A is reconstructed by replacing the elements of P. A subset Q of A is chosen again. The number of ways of choosing P and Q such that Q contains just one element more than P is

  10. If one root of x2 + px − q2 = 0, p and q are real, be less than 2 and other be greater than 2, then


Important Questions from Algebra

  1. Let S be the set of the first 11 natural numbers. Then the number of elements in $A = \{B \subseteq S : n(B) \geq 2$ and the product of all elements of B is even is ________.

  2. The number of $3 \times 2$ matrices A, which can be formed using the elements of the set $\{-2, -1, 0, 1, 2\}$ such that the sum of all the diagonal elements of $A^T A$ is 5, is ______
  3. Let $z = (1 + i)(1 + 2i)(1 + 3i) \dots (1 + ni)$, where $i = \sqrt{-1}$. If $|z|^2 = 44200$, then $n$ is equal to _______
  4. Let $a_1 = 1$ and for $n \ge 1, a_{n+1} = \frac{1}{2} a_n + \frac{n^2 - 2n - 1}{n^2(n+1)^2}$. Then $\left| \sum_{n=1}^\infty \left( a_n - \frac{2}{n^2} \right) \right|$ is equal to ____________.
  5. If $ \left(\frac{1}{^{15}C_0} + \frac{1}{^{15}C_1}\right)$ $\left(\frac{1}{^{15}C_1} + \frac{1}{^{15}C_2}\right)$ $\dots$ $ \left(\frac{1}{^{15}C_{12}} + \frac{1}{^{15}C_{13}}\right)$ = $\frac{\alpha^{13}}{^{14}C_0  ^{14}C_1 \dots ^{14}C_{12}} $, then $30\alpha$ is equal to __________.

Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App