Problem 376

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


See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
omg
Posts: 3
Joined: Thu Mar 01, 2012 4:33 am

Re: problem 376 clarification

Post by omg »

"For N = 7 we find there are 9780 such sets. How many are there for N = 30 ?"
Does case N=30 include all those 9780 of case N=7 ?

If I ask "someone please send me a private message to confirm the number of sets in case N=16"
will it violate forum rules?
sivakd
Posts: 217
Joined: Fri Jul 17, 2009 9:37 am
Location: California, USA
Contact:

Re: problem 376 clarification

Post by sivakd »

Yes, N = 30 includes cases for N < 30.

I think it probably won't violate the rules if that's what you wish but I would say you at least wait till the first 50 are complete before asking for confirmation via pm. Also, frankly if you know how to solve for N = 7 then it's just a matter of figuring out how to solve it efficiently for 30 and the result for 16 should not matter. I also usually have a bruit-force version for almost all problems to understand the problem and to debug. If you write such a program, you can easily go up to N = 10 to 13 before it becomes very slow. But that should confirm the values for your fast algorithm.
Image
puzzle is a euphemism for lack of clarity
Post Reply