You have n consecutive natural numbers less than 100.
Let p be the product of all those numbers.
What is the smallest n such, that p is divisible by all prime numbers less than 100.
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.
I think there is a typing error. You wrote "between 57 and 97", but I'm sure you mean 53.
No prime bigger than 5 0 has any multiple other than itself less than 1 0 0 . This means we need all of the primes (from 5 3 to 9 7 ) to be included in the list.
Every prime less than 5 0 has at least one multiple in the range 5 3 to 9 7 , so this is actually enough; there are 9 7 − 5 3 + 1 = 4 5 consecutive numbers in this list.
With the Sieve of Eratosthenest we can easily find all prime numbers less than 100.
(1) 2; 3; 5; 7; 11; 13; 17; 19; 23; 29; 31; 37; 41; 43; 47;
(2) 53; 59; 61; 67; 71; 73; 79; 83; 89; 97
The lowest multiple of 53 is 106, therefore every prime of the (2) row has to be one of those consecutive numbers. Now we have 45 consecutive numbers. If we have j consecutive numbers, then there is at least one of them, which is devisible by j . Therefore if we take 45 consecutive numbers from 53 to 97, p is devisible by all numbers of the (1) row except 47, but 2 ⋅ 4 7 = 9 4 . Our p is devisible by all prime numbers less than 100.
Thus n = 4 5
Problem Loading...
Note Loading...
Set Loading...
The primes less than 100 are:
2 , 3 , 5 , 7 , 1 1 , 1 3 , 1 7 , 1 9 , 2 3 , 2 9 , 3 1 , 3 7 , 4 1 , 4 3 , 4 7 , 5 3 , 5 9 , 6 1 , 6 7 , 7 1 , 7 3 , 7 9 , 8 3 , 8 9 , 9 7
Any prime less than 50 has a multiple between 53 and 97. Therefore, the "shortest" p which is divisible by all the primes less than 100 is p = 5 3 × 5 4 × 5 5 × ⋯ × 9 7 , where the number of consecutive natural numbers is n = 9 7 − 5 3 + 1 = 4 5 .