Problem 660

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
User avatar
reinermartin
Posts: 56
Joined: Sat Mar 09, 2019 8:38 pm
Location: Bad Soden, Germany

Problem 660

Post by reinermartin »

If a triangle happens to be $n$-pandigital for multiple $n,$ is it still included only once in the calculation? (Not sure that ever happens, just want to be clear on the definition.)
Last edited by reinermartin on Sat Mar 09, 2019 11:13 pm, edited 1 time in total.
Image
Top
User avatar
hk
Administrator
Posts: 12832
Joined: Sun Mar 26, 2006 10:34 am
Location: Haren, Netherlands

Re: Problem 660

Post by hk »

If a triangle is n-pandigital for multiple n all of them are counted.
Image
War ruins the life and health of untold numbers of innocent children.
Top
Post Reply

Return to “Clarifications on Project Euler Problems”