1 × 2 × 3 × ⋯ × 6 = ( 1 × 2 × 3 ) × ( 1 × 2 × 3 × 4 × 5 )
Extending the above to a larger number, we find that there exists an integer N ( > 6 ) such that 1 × 2 × 3 × ⋯ × N = ( 1 × 2 × 3 × ⋯ × A ) × ( 1 × 2 × 3 × ⋯ × B ) , where A and B are both integers larger than 1.
What is the smallest N ?
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.
same method I used!
if N itself is p + 1 , where p is a prime number, N must be a factorial itself. 1 4 − 1 = 1 3 is a prime, 1 2 − 1 = 1 1 is a prime, 8 − 1 = 7 is a prime. 8 , 1 2 and 1 4 are no factorials. We only have to check 10. 1 0 ! = 1 0 ∗ 9 ∗ 8 ∗ 7 ! . . . = ( 5 ∗ 2 ) ∗ ( 3 ∗ 3 ) ∗ ( 4 ∗ 2 ) ∗ 7 ! = ( 3 ∗ 2 ∗ 5 ∗ 4 ∗ 3 ∗ 2 ) ∗ 7 ! = 6 ∗ 5 ∗ 4 ∗ 3 ∗ 2 ∗ 1 ∗ 7 ! = 6 ! ∗ 7 !
Problem Loading...
Note Loading...
Set Loading...
First, I make a list of the first few factorials. 1, 2, 6, 24, 120, 720, 5040, ... Next, I try every number n on the choices, and calculate n , n ( n − 1 ) , n ( n − 1 ) ( n − 2 ) , and so on, and see if I can get a number on the list above. I found that 1 0 × 9 × 8 = 6 ! . And we are done. 1 0 ! = 7 ! × 6 !