Let n be a natural number, such that n is divisible by any natural number, which is smaller or equal to n .
What is the sum of all posible numbers 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.
For the first 2 natural numbers ( 1 and 2 ) this is clearly true. For all other numbers:
If a natural number n is divisible by all smaller natural numbers. n is divisible by all primes less than n .
The next number after 2 , which could be such a number is 4 . But the product of all primes less than 4 is 2 ⋅ 3 = 6 . Thus the next possible number after 2 is 6 . But 6 ± 1 is a prime.
This is true, because : l c m ( x , x ± 1 ) = 1 .
Generally the product of the first p primes ( p s u m = p 1 ⋅ p 2 ⋅ ⋯ ⋅ p x − 1 ⋅ p x ) is not divisible by all primes less than p s u m because p s u m − 1 is a prime and is not included in p s u m .
Thus 1 and 2 are the only natural numbers for which this holds true and the sum is 3 .
Problem Loading...
Note Loading...
Set Loading...
The only such natural numbers are 1 and 2 , with sum 3 .
There are no natural numbers smaller than 1 , so let's assume n > 1 . If all numbers less than or equal to n divide n , then in particular n − 1 divides n . But n − 1 n = 1 + n − 1 1 , and for this to be a whole number, we need n − 1 to divide 1 . The only factor of 1 is 1 ; so the only other solution is n = 2 , and we're done.