Some idea regarding this problem

Revision en1, by dca, 2020-07-31 06:10:05

I am given an integer $$$A$$$ of size $$$N$$$. I want to make a multiset from $$$A$$$ such that, if any two elements of the multiset are multiplied, the product should not be a perfect cube. What is the maximum size of the multiset? I can only think of the bruteforce approach. Can we solve it in some efficient way?

Tags #number theory, #math

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English dca 2020-08-01 01:11:39 6 Tiny change: 'n integer $A$ of si' -> 'n integer array $A$ of si'
en3 English dca 2020-08-01 01:06:37 30 Tiny change: 'c number. ' -> 'c number. $N<=1000$, $1$ $<=Ai<=$ $10^6$'
en2 English dca 2020-08-01 01:05:30 182
en1 English dca 2020-07-31 06:10:05 339 Initial revision (published)