Let and be positive integers and assume that is an odd integer. Prove that at least one divisor of can be expressed in the form where is a positive integer.
Solutions — 2
Solution 1
Let and where and are odd integers. Without loss of generality we can assume that . We have
If , then the denominator is odd and therefore is even. So we have and . Let with . So . As is odd, it must be that is divisible by , so is divisible by 4. As and are odd integers, one of them, say is congruent to 3 modulo 4. But , so is a divisor of .
Solution 2
1. Given: is an odd integer, where and are positive integers.
2. Claim: is less than or . Assume for contradiction that and .
3. Contradiction: If and , then:
This implies:
Simplifying these inequalities:
Adding these inequalities:
This is always true, so the contradiction does not arise from this step. Instead, we need to consider the properties of .
4. Substitution: Assume for some . Substituting into the equation:
leads to:
Multiplying both sides by :
Expanding and rearranging:
5. Discriminant Analysis: Considering the discriminant of the quadratic equation:
For to be an integer, must be a perfect square. Let:
Rearranging:
This can be written as:
6. **Existence of and **: There exist such that:
Solving these:
Since is odd, one of or must be even and the other odd.
7. Conclusion: If is even and is odd, then:
This implies that has a divisor of the form .