For all positive integral values of n,{3^{2n} | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) Let $f(n) = 3^{2n} - 2n + 1$. For $n = 1$,$f(1) = 3^{2(1)} - 2(1) + 1 = 9 - 2 + 1 = 8$. For $n = 2$,$f(2) = 3^{2(2)} - 2(2) + 1 = 81 - 4 + 1 = 78$

Vedclass · Accepted Answer

$2$

Vedclass · Answer

(A) Let $f(n) = 3^{2n} - 2n + 1$. For $n = 1$,$f(1) = 3^{2(1)} - 2(1) + 1 = 9 - 2 + 1 = 8$. For $n = 2$,$f(2) = 3^{2(2)} - 2(2) + 1 = 81 - 4 + 1 = 78$. Wait,let us re-evaluate the expression. $3^{2n} = 9^n = (1 + 8)^n = 1 + n(8) + \frac{n(n-1)}{2}(8^2) + \dots$ So,$3^{2n} - 2n + 1 = (1 + 8n + 32n(n-1) + \dots) - 2n + 1 = 6n + 2 + 32n(n-1) + \dots$ Actually,checking $n=1$ gives $8$,which is divisible by $8$. Checking $n=2$ gives $78$,which is not divisible by $8$. However,the expression $3^{2n} - 2n + 1$ is always divisible by $8$ if the term was $3^{2n} - 8n + 1$ or similar. Given the options,let us check $n=1 \implies 8$ and $n=2 \implies 78$. Since $8$ is divisible by $2$ and $78$ is divisible by $2$,the correct option is $2$.

For all positive integral values of $n$,${3^{2n}} - 2n + 1$ is divisible by

Similar Questions

Prove the following by using the principle of mathematical induction for all $n \in N$:
$1 \cdot 2 \cdot 3 + 2 \cdot 3 \cdot 4 + \ldots + n(n+1)(n+2) = \frac{n(n+1)(n+2)(n+3)}{4}$

Let $P(n) : 3^n < n!$ for $n \in N$ be true for $n \geq \lambda$. Find the smallest value of $\lambda$.

Prove the statement by the Principle of Mathematical Induction: $n(n^{2}+5)$ is divisible by $6$,for each natural number $n$.

Prove the following by using the principle of mathematical induction for all $n \in N$:
$\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\ldots+\frac{1}{2^{n}}=1-\frac{1}{2^{n}}$

The statement $P(n): 1 \times 1! + 2 \times 2! + 3 \times 3! + \dots + n \times n! = (n + 1)! - 1$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module