Freaky Factorials

Find the sum of all integers m m that are less than 1000 1000 and equal to n ! + 1 \sqrt{n!+1} for some positive integer n n .

Details and assumptions

The number n ! n! , read as n factorial , is equal to the product of all positive integers less than or equal to n n . For example, 7 ! = 7 × 6 × 5 × 4 × 3 × 2 × 1 7! = 7 \times 6 \times 5 \times 4 \times 3 \times 2 \times 1 .


The answer is 87.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

6 solutions

Since n can only be up to 9. Then it would be easy to try the numbers n n from 1-9 if n ! + 1 \sqrt{n!+1} is an integer.

Values of n n could be 4 4 , 5 5 and 7 7 . Using these numbers we could get m m as 5 5 , 11 11 , and 71 71 . 5 + 11 + 71 = 5+11+71= 87 \boxed{87} .

Can you connect your argument and explain why "Since n n ca only be up to 9"?

Calvin Lin Staff - 7 years, 7 months ago

Log in to reply

Note that if n 10 n \geq 10 , m > 1000 m > 1000 . Thus, we will just exclude the integers n 10 n \geq 10 .

Jeffer Dave Cagubcob - 7 years, 7 months ago

Log in to reply

Thanks Jeffer. I realized I was on The wrong Path. I was searching numbers fulfilling the criteria: n!=(m+1)(m-1). But your approach has made my thinking very clear.Thanks

Rajdeep Choudhury LP - 7 years, 6 months ago

So finding out the what the range of n is a strategy here? But what if we were to find all integers m m that were less than a million? I understand that factorial grows rapidly so it is ideal to find the range of n, but is there another tactical solution that I've missed?

Thanks!

Sherry Sarkar - 7 years, 7 months ago

Log in to reply

n ! + 1 = m 2 n! + 1 = m^2 is actually known as Brocard's problem . Other then the solutions ( n , m ) = ( 4 , 5 ) , ( 5 , 11 ) , ( 7 , 71 ) (n,m) = (4,5), (5,11), (7, 71) , it is not known if any other solution exists. Erdos conjectures that there are no more solutions. A computer search shows finds no more solutions for n n up to 1 0 9 10^9 .

Calvin Lin Staff - 7 years, 7 months ago

I don't know. Hahaha XD. Perhaps somebody can answer your question..

Jeffer Dave Cagubcob - 7 years, 7 months ago

According to the question, n ! + 1 \sqrt{n!+1} is an integer m such that m 999. m \leq 999. In order to find m, we need to find the value of n ! + 1 99 9 2 n!+1 \leq 999^{2} The value of n which suffice this inequality are limited, i.e. n ϵ { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } n \epsilon\{1,2,3,4,5,6,7,8,9\} ( n ! + 1 ) ϵ { 1 ! , 2 ! , 3 ! , 4 ! , 5 ! , 6 ! , 7 ! , 8 ! , 9 ! } \Rightarrow (n!+1) \epsilon\{1!,2!,3!,4!,5!,6!,7!,8!,9!\} Now, taking case by case, we find that only three cases suffice that m is an integer less than 1000 and they are, 4 ! + 1 = 25 = 5 \sqrt{4!+1}=\sqrt{25}=5 5 ! + 1 = 121 = 11 \sqrt{5!+1}=\sqrt{121}=11 7 ! + 1 = 5041 = 71 \sqrt{7!+1}=\sqrt{5041}=71 Thus the values of m are 5 , 11 , 71 5,11,71 Hence, sum of all values of m, 5 + 11 + 71 5+11+71 = 87 =\boxed{87}

Kishlaya Jaiswal
Nov 14, 2013

Clearly n > 0 n > 0 and m < 1000 m < 1000

So, m = ( n ! + 1 ) < 1000 n ! < 100 0 2 1 m = \sqrt(n!+1) < 1000 \Rightarrow n! < 1000^2-1

Hence, n < 10 n < 10 because 10 ! = 3628800 > 100 0 2 1 10! = 3628800 > 1000^2-1

Since m m and n n both should be integers, we find that only for n = 4 , 5 , 7 n = 4,5,7 , m m is an integer.

for n = 4 n=4 , m = ( 4 ! + 1 ) = 5 m=\sqrt(4!+1) = 5

for n = 5 n=5 , m = ( 5 ! + 1 ) = 11 m=\sqrt(5!+1) = 11

for n = 7 n=7 , m = ( 7 ! + 1 ) = 71 m=\sqrt(7!+1) = 71

Summing up, all the values of m = 5 + 11 + 71 = 87 m = 5+11+71=\boxed{87}

we observe that here root over of 9!+1 exceeds 1000 so the value of n must be less than 9 we have thus the following results

\sqrt{4!+1}=5

\sqrt{5!+1}=11

\sqrt{7!+1}=71

Required sum is \boxed{87}

Piyushkumar Palan
Nov 16, 2013

:

We just need to check for n = 1 n=1 to n = 9 n=9

( because 10 ! + 1 = 3 , 628 , 801 > 1 , 000 , 000 = 100 0 2 10! + 1 = 3,628,801 > 1,000,000 = 1000^2

so for n 10 , n ! + 1 > 1000 n \geq 10, \sqrt{n!+1} > 1000 )

Now

1 ! + 1 = 2 1! + 1 = 2 \rightarrow Not a perfect square

2 ! + 1 = 3 2! + 1 = 3 \rightarrow Not a perfect square

3 ! + 1 = 7 3! + 1 = 7 \rightarrow Not a perfect square

4 ! + 1 = 25 = 5 2 4! + 1 = 25 = 5^2

5 ! + 1 = 121 = 1 1 2 5! + 1 = 121 = 11^2

6 ! + 1 = 721 6! + 1 = 721 \rightarrow Not a perfect square

7 ! + 1 = 5041 = 7 1 2 7! + 1 = 5041 = 71^2

8 ! + 1 = 40 , 321 8! + 1 = 40,321 \rightarrow Not a perfect square

9 ! + 1 = 362 , 881 9! + 1 = 362,881 \rightarrow Not a perfect square

So possible values of m are 5 , 11 , 71 5, 11, 71

Answer: 5 + 11 + 71 = 87 5 + 11 + 71 = \boxed{87}

I tried but could get no clue as to how to 'generalize' this question. Can it be done?

Piyushkumar Palan - 7 years, 6 months ago

Log in to reply

oh it can't as if now..calvin sir clarified in a comment

Piyushkumar Palan - 7 years, 6 months ago
Sagar Bhatia
Nov 11, 2013

n n! n!+1 perfect square?
1...1....2....no
2...2....3....no
3...6....7....no
4..24..25...yes -- 5
5..120.121..yes -- 11
6..720..721..no
7..5040..5041..yes -- 71
8..40320..40321...no
9...362880..362881..no
10...3628800 greater than 1 million sqrt(10!) is greater than 1000







5+11+71

I'm sorry but I don't quite understand why n and n! have to be perfect squares. All else makes perfect sense though.

Sam Ringer - 7 years, 7 months ago

Log in to reply

The writeup could be explained better. All that we care about is n ! + 1 n! + 1 is a perfect square. I believe he wanted to create a table, and I've made some edits to reflect that.

Calvin Lin Staff - 7 years, 7 months ago

Check the question! "all integer m.." it means it should be perfect square.

Hafizh Ahsan Permana - 7 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...