The last two digits of 2015! + 3^{2015} are: | vedclass

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

Question

(D) We need to find the last two digits of $2015! + 3^{2015}$.Since $2015!$ contains factors like $2, 5, 10, 20$,etc.,it is a multiple of $100$ for an

Vedclass · Accepted Answer

$07$

Vedclass · Answer

(D) We need to find the last two digits of $2015! + 3^{2015}$.Since $2015!$ contains factors like $2, 5, 10, 20$,etc.,it is a multiple of $100$ for any $n \ge 10$. Thus,the last two digits of $2015!$ are $00$.Now,we find the last two digits of $3^{2015}$ by calculating $3^{2015} \pmod{100}$.Using Euler's totient theorem,$\phi(100) = 100(1 - 1/2)(1 - 1/5) = 40$.Since $\gcd(3, 100) = 1$,we have $3^{40} \equiv 1 \pmod{100}$.$2015 = 40 	imes 50 + 15$,so $3^{2015} \equiv 3^{15} \pmod{100}$.$3^4 = 81 \equiv -19 \pmod{100}$.$3^8 = (81)^2 = 6561 \equiv 61 \pmod{100}$.$3^{12} = 3^8 	imes 3^4 = 61 	imes 81 = 4941 \equiv 41 \pmod{100}$.$3^{15} = 3^{12} 	imes 3^3 = 41 	imes 27 = 1107 \equiv 07 \pmod{100}$.Therefore,the last two digits are $07$.

The last two digits of $2015! + 3^{2015}$ are:

Similar Questions

Among the inequalities below,which ones are true for all natural numbers $n > 1000$?
$I. n! \leq n^n$
$II. (n!)^2 \leq n^n$
$III. 10^n \leq n!$
$IV. n^n \leq (2n)!$

$A$ five-digit number divisible by $3$ has to be formed using the numerals $0, 1, 2, 3, 4,$ and $5$ without repetition. The total number of ways in which this can be done is:

The total number of three-digit numbers,where exactly one digit is repeated two times,is

The number of numbers between $2000$ and $5000$ that can be formed with the digits $0, 1, 2, 3, 4$ (repetition of digits not allowed) and are multiples of $3$ is:

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

Vedclass Test Series

Exam Paper Generator

Online Exam Module