The total number of two-digit numbers n such | vedclass

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

Question

(A) We want $3^{n} + 7^{n} \equiv 0 \pmod{10}$.Since $7 \equiv -3 \pmod{10}$,we have $7^{n} \equiv (-3)^{n} \pmod{10}$.Thus,$3^{n} + 7^{n} \equiv 3^{n

Vedclass · Accepted Answer

$45$

Vedclass · Answer

(A) We want $3^{n} + 7^{n} \equiv 0 \pmod{10}$.Since $7 \equiv -3 \pmod{10}$,we have $7^{n} \equiv (-3)^{n} \pmod{10}$.Thus,$3^{n} + 7^{n} \equiv 3^{n} + (-1)^{n} 3^{n} \pmod{10}$.If $n$ is even,$3^{n} + 3^{n} = 2 \cdot 3^{n}$,which is not divisible by $10$ (as $3^{n}$ ends in $1$ or $9$,so $2 \cdot 3^{n}$ ends in $2$ or $8$).If $n$ is odd,$3^{n} + (-1) 3^{n} = 3^{n} - 3^{n} = 0$,which is divisible by $10$.Therefore,$n$ must be an odd number.The two-digit numbers are from $10$ to $99$.The total number of two-digit numbers is $99 - 10 + 1 = 90$.Exactly half of these are odd,so the number of odd two-digit numbers is $90 / 2 = 45$.

The total number of two-digit numbers $n$ such that $3^{n} + 7^{n}$ is a multiple of $10$ is ..... .

Similar Questions

The number of $4$-letter permutations formed using the English alphabet such that the number of distinct vowels is equal to the number of distinct consonants,when repetition is allowed,is

Let $S$ be the set of all permutations $a_1, a_2, \ldots, a_6$ of $1, 2, \ldots, 6$ such that $a_1, a_2, \ldots, a_k$ is not a permutation of $1, 2, \ldots, k$ for any $k, 1 \leq k \leq 5$. Then the number of elements in $S$ is:

For all $n \in N$,the product $(n+24)(n+25)(n+26)(n+27)$ is always divisible by:

$n$ objects are distributed at random among $n$ persons. The number of ways in which this can be done so that at least one of them will not get any object is

The number of permutations of the digits $1, 2, 3, ..., 7$ without repetition,which neither contain the string $153$ nor the string $2467$,is $........$.

Vedclass Test Series

Exam Paper Generator

Online Exam Module