We need to determine all pairs of positive integers (a,b) such that the expression:
2ab2−b3+1a2
is a positive integer. Let's denote this integer by n. Hence, we have:
a2=n(2ab2−b3+1)
Let's explore different cases for b.
### Case 1: b=1
Substituting b=1 into the equation:
a2=n(2a(1)2−(1)3+1)=n(2a−1+1)=2na
which simplifies to:
a2=2na
If a=0, then we can divide both sides by a:
a=2n
This leads us to pairs of the form:
(a,b)=(2l,1)
for some positive integer l.
### Case 2: b=2
Let's consider b=2:
a2=n(2a(2)2−(2)3+1)
a2=n(8a−8+1)=n(8a−7)
If we take values a=k⋅b=k⋅2=2k, substitute in:
(2k)2=n(16k−7)
Rewriting gives:
4k2=n(16k−7)
For symmetry, check if k=l:
4k2=n(16l−7)
Possible values arise when the right side is a perfect square, giving pairs of the form:
(a,b)=(l,2l)
### General Case: b=2l
For b=2l and some constraints, assume a=8l4−l:
a2=(8l4−l)2
Check divisibility and constraint conditions forming another set:
(a,b)=(8l4−l,2l)
Thus, the possible integer solutions considering all cases are given by:
(a,b)=(2l,1)or(l,2l)or(8l4−l,2l)
for some positive integer l.
The solution set is therefore:
(a,b)=(2l,1)or(l,2l)or(8l4−l,2l)