Problem 068

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.
Post Reply
demebeu
Posts: 4
Joined: Sat Oct 27, 2007 1:25 pm

Problem 068

Post by demebeu »

I've generated all permutations for the 10 gon ring, and i've got the following 16 digit maximum :
9, 4, 1; 10, 1, 3; 6, 3, 5; 7, 5, 2; 8, 2, 4. The sum is 14.
Why is this solution wrong? Any idea whats wrong with my gon ring?

Please see the attached picture.
You do not have the required permissions to view the files attached to this post.
User avatar
hk
Administrator
Posts: 12832
Joined: Sun Mar 26, 2006 10:34 am
Location: Haren, Netherlands

Re: problem 68

Post by hk »

"Working clockwise, and starting from the group of three with the numerically lowest external node" means
your gon-ring would produce the following answer:
6,3,5;7;5;2.....
as you should strart with the lowest number i.e. 6
But then there is a "higher" solution.
Image
War ruins the life and health of untold numbers of innocent children.
Post Reply