Determine the largest number of distinct positive integers you can have such that the difference between any two of them is prime, and this difference divides both of those numbers.
(In reply to
possible solution by Charlie)
I also cannot think of any way to have more than 2 numbers fitting the criteria.
But there can be groups of two integers whose difference is a prime other than 2.
[35, 40] differ by 5 and are each divisible by 5
[np, (n+1)p] works for any prime p.
|
Posted by Larry
on 2024-03-06 09:30:05 |