A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
In particular don't post any code fragments or results.
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
Even though English is my native language, I'm having a lot of trouble understanding this problem. But perhaps it's due to my advanced age!
In the sentence:
For this problem we shall assume that a given set contains n strictly increasing elements and it already satisfies the second rule.
1) Is it implied that the strictly increasing elements are integers but not necessarily consecutive integers?
2) I don't see how a set can satisfy the second rule, as the second rule concerns two non-empty disjoint subsets, and not a single set. Or does it mean that the set is such that, for any two non-empty disjoint subsets of the set, the second rule is satisfied?
--
Colin
