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 Solvers7
Suggested Problems
-
Project Euler: Problem 5, Smallest multiple
1650 Solvers
-
518 Solvers
-
295 Solvers
-
Implement a bubble sort technique and output the number of swaps required
387 Solvers
-
Vector of numbers divisible by 3
153 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.