How many natural numbers n are there such tha | vedclass

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

Question

(A) We are looking for natural numbers $n$ such that $n! + 10 = k^2$ for some integer $k$.Case $1$: If $n=1$,$1! + 10 = 11$ (not a perfect square).Cas

Vedclass · Accepted Answer

$1$

Vedclass · Answer

(A) We are looking for natural numbers $n$ such that $n! + 10 = k^2$ for some integer $k$.Case $1$: If $n=1$,$1! + 10 = 11$ (not a perfect square).Case $2$: If $n=2$,$2! + 10 = 12$ (not a perfect square).Case $3$: If $n=3$,$3! + 10 = 6 + 10 = 16 = 4^2$ (a perfect square).Case $4$: If $n=4$,$4! + 10 = 24 + 10 = 34$ (not a perfect square).Case $5$: If $n=5$,$5! + 10 = 120 + 10 = 130$ (not a perfect square).Case $6$: If $n \ge 5$,then $n!$ is a multiple of $10$ because $n!$ contains the factors $2$ and $5$.Thus,$n! + 10 = 10m + 10 = 10(m+1)$ for some integer $m$.For $n \ge 5$,$n!$ is a multiple of $100$ (since $n!$ contains $2 	imes 5 	imes 10 = 100$ for $n \ge 10$,and for $n=5, 6, 7, 8, 9$,we check manually: $5!=120, 6!=720, 7!=5040, 8!=40320, 9!=362880$).Specifically,for $n \ge 5$,$n! + 10$ ends in the digit $0$ (since $n!$ ends in $0$ for $n \ge 5$).For a number ending in $0$ to be a perfect square,it must end in $00$. However,$n! + 10$ for $n \ge 5$ ends in $10, 20, 30, 40, 50, 60, 70, 80, 90$ (specifically $130, 730, 5050, 40330, 362890$).None of these are perfect squares.Therefore,only $n=3$ satisfies the condition.

How many natural numbers $n$ are there such that $n! + 10$ is a perfect square?

Similar Questions

Four-digit numbers with all digits distinct are formed using the digits $1, 2, 3, 4, 5, 6, 7$ in all possible ways. If $p$ is the total number of numbers thus formed and $q$ is the number of numbers greater than $3400$ among them,then $p: q=$

Five-digit numbers are formed using the digits $1, 2, 3, 4, 5, 6$,and $8$. What is the probability that they have even digits at both the ends?

$A$ pack contains $n$ cards numbered from $1$ to $n$. Two consecutive numbered cards are removed from the pack and the sum of the numbers on the remaining cards is $1224$. If the smaller of the numbers on the removed cards is $k$,then $k - 20 =$

If ${}^n P_r = 30240$ and ${}^n C_r = 252$,then the ordered pair $(n, r)$ is equal to

$3$ boys $B_i, i = 1, 2, 3$ and $6$ girls $G_i, i = 1, 2, . . . , 6$ are to be seated in a row. The number of ways they can be seated so that $B_1, B_2$ are separated and $G_1, G_2$ are also separated is equal to:

Vedclass Test Series

Exam Paper Generator

Online Exam Module