Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 1.3.51* (Largest integer divisible by all integers less than its square root.)
Exercise 1.3.51* (Largest integer divisible by all integers less than its square root.)
Show that is the largest integer divisible by all integers less than its square root.
(Hint: Consider the highest power of , of , of , of less that the square root.)
Answers
Proof. The positive integers less than the square root of are , and is divisible by all these integers.
Let . Consider the highest powers of , of , of , of less that the square root:
Suppose that is divisible by all integers less than its square root. Then is divisible by , , , , therefore
a fortiori . Therefore
This implies , so every integer greater than is not divisible by all integers less than its square root.
Its remains the integers , where , for which we verify the same property with a computer program, which returns all integers up to divisible by all integers less than .
def verif(maxi): l = [] for n in range(1,maxi + 1): test = True i = 1 while test and i * i < n: if n % i != 0: test = False i = i + 1 if test: l.append(n) return l verif(210) [1, 2, 3, 4, 6, 8, 12, 24]
So is the largest integer divisible by all integers less than its square root. □
Note: there is another solution using the fact that is divisible by , but not shorter.