Find the sum of all integers m that are less than 1 0 0 0 and equal to n ! + 1 for some positive integer n .
Details and assumptions
The number n ! , read as n factorial , is equal to the product of all positive integers less than or equal to n . For example, 7 ! = 7 × 6 × 5 × 4 × 3 × 2 × 1 .
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.
Can you connect your argument and explain why "Since n ca only be up to 9"?
Log in to reply
Note that if n ≥ 1 0 , m > 1 0 0 0 . Thus, we will just exclude the integers n ≥ 1 0 .
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
So finding out the what the range of n is a strategy here? But what if we were to find all integers 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!
Log in to reply
n ! + 1 = m 2 is actually known as Brocard's problem . Other then the solutions ( n , m ) = ( 4 , 5 ) , ( 5 , 1 1 ) , ( 7 , 7 1 ) , 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 up to 1 0 9 .
I don't know. Hahaha XD. Perhaps somebody can answer your question..
According to the question, n ! + 1 is an integer m such that m ≤ 9 9 9 . In order to find m, we need to find the value of n ! + 1 ≤ 9 9 9 2 The value of n which suffice this inequality are limited, i.e. n ϵ { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } ⇒ ( n ! + 1 ) ϵ { 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 = 2 5 = 5 5 ! + 1 = 1 2 1 = 1 1 7 ! + 1 = 5 0 4 1 = 7 1 Thus the values of m are 5 , 1 1 , 7 1 Hence, sum of all values of m, 5 + 1 1 + 7 1 = 8 7
Clearly n > 0 and m < 1 0 0 0
So, m = ( n ! + 1 ) < 1 0 0 0 ⇒ n ! < 1 0 0 0 2 − 1
Hence, n < 1 0 because 1 0 ! = 3 6 2 8 8 0 0 > 1 0 0 0 2 − 1
Since m and n both should be integers, we find that only for n = 4 , 5 , 7 , m is an integer.
for n = 4 , m = ( 4 ! + 1 ) = 5
for n = 5 , m = ( 5 ! + 1 ) = 1 1
for n = 7 , m = ( 7 ! + 1 ) = 7 1
Summing up, all the values of m = 5 + 1 1 + 7 1 = 8 7
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}
:
We just need to check for n = 1 to n = 9
( because 1 0 ! + 1 = 3 , 6 2 8 , 8 0 1 > 1 , 0 0 0 , 0 0 0 = 1 0 0 0 2
so for n ≥ 1 0 , n ! + 1 > 1 0 0 0 )
Now
1 ! + 1 = 2 → Not a perfect square
2 ! + 1 = 3 → Not a perfect square
3 ! + 1 = 7 → Not a perfect square
4 ! + 1 = 2 5 = 5 2
5 ! + 1 = 1 2 1 = 1 1 2
6 ! + 1 = 7 2 1 → Not a perfect square
7 ! + 1 = 5 0 4 1 = 7 1 2
8 ! + 1 = 4 0 , 3 2 1 → Not a perfect square
9 ! + 1 = 3 6 2 , 8 8 1 → Not a perfect square
So possible values of m are 5 , 1 1 , 7 1
Answer: 5 + 1 1 + 7 1 = 8 7
I tried but could get no clue as to how to 'generalize' this question. Can it be done?
Log in to reply
oh it can't as if now..calvin sir clarified in a comment
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.
Log in to reply
The writeup could be explained better. All that we care about is n ! + 1 is a perfect square. I believe he wanted to create a table, and I've made some edits to reflect that.
Check the question! "all integer m.." it means it should be perfect square.
Problem Loading...
Note Loading...
Set Loading...
Since n can only be up to 9. Then it would be easy to try the numbers n from 1-9 if n ! + 1 is an integer.
Values of n could be 4 , 5 and 7 . Using these numbers we could get m as 5 , 1 1 , and 7 1 . 5 + 1 1 + 7 1 = 8 7 .