Let be positive numbers such that Assume that a positive integer is limited to such that is divisible by
(1) Prove that is divisible by and
(2) Prove that the prime factor of are limited to and
(3) Find
Problem 1279
Official solution
Given the conditions:
and the assumption that is divisible by where .
### Part 1: Prove that is divisible by and .
1. From the equation , we can see that . For to be an integer, must be divisible by . Since is a positive integer, itself must be divisible by . Let for some integer . Then:
Substituting back, we get:
Thus, is divisible by .
2. From the equation , we can see that . For to be an integer, must be divisible by . Since is a positive integer, itself must be divisible by . Let for some integer . Then:
Substituting back, we get:
Thus, is divisible by .
Since is divisible by both and , we conclude that is divisible by .
### Part 2: Prove that the prime factors of are limited to and .
1. From the previous part, we have:
Since must satisfy both conditions simultaneously, we equate the two expressions:
This implies that must be a common multiple of and . The least common multiple of and is . Therefore, must be of the form:
for some integer .
2. Since is of the form , the prime factors of are and .
### Part 3: Find .
1. From the equation , we need to find integers and such that this equation holds. We rewrite it as:
This implies that and must be chosen such that both sides are equal. Since and must be equal, we need to find the smallest and that satisfy this condition.
2. By trial and error or by solving the equation, we find that the smallest values that satisfy this condition are and . Substituting these values back, we get:
Since both expressions must be equal, we find that the smallest value of that satisfies both conditions is .
The final answer is .