+0  
 
+1
45
2
avatar

I've been toying around with the following idea in my head for a while, and have never managed to come up with a counter-example, but I'm not sure if the following is true:
Suppose you have a list of positive integers. If one of the numbers in the list is divisible by a prime p, then there is at least one more number in the list that is also divisible by p. Also, if a different number is divisible by a prime q, then there is another number in the list divisible by pq. Can you always partition this list up into three smaller lists of no intersection such that if one partitioned list has an element divisible by a prime p, then in one of the other sets there is also an element divisible by p.

 Mar 6, 2021
 #1
avatar
+1

I'm not sure about proving it, but it certainly seems as if the property must hold. How about trying induction?

 Mar 6, 2021
 #2
avatar+10 
0

That's a really interesting question. Anyone have any ideas?

 Mar 7, 2021

39 Online Users

avatar
avatar
avatar
avatar
avatar
avatar
avatar