Inspired by problem 660.
Given n return two disjoint sets of integers A and B with same cardinality having following property:
for i = 1:n
Try to minimize sets cardinality.
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers11
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6847 Solvers
-
2194 Solvers
-
95 Solvers
-
Magic is simple (for beginners)
11746 Solvers
-
Sort complex numbers into complex conjugate pairs
134 Solvers
More from this Author40
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
assert(isequal(sum(A(:).^(1:n)), sum(A(:).^(1:n)))), makes it too basic.
( ·_ゝ·)
I have no idea what I was thinking of when I wrote this. Thanks for pointing that out so quickly.