Problem 029

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
mpiotte
Administrator
Posts: 1961
Joined: Tue May 08, 2012 5:40 pm
Location: Montréal, Canada

Re: Problem 29

Post by mpiotte »

Liquid25677 wrote: Thu Jun 09, 2022 2:34 pm ...
Very strange, I'm getting different results. I also checked manually and I can't find where I'm wrong. These are the terms, o = count, x = don't count, for n = 12
...
You are still having duplicates. For example $8^6 = 4^9 = 262144$.
Top
Liquid25677
Posts: 9
Joined: Thu May 26, 2022 4:07 pm

Re: Problem 29

Post by Liquid25677 »

mpiotte wrote: Thu Jun 09, 2022 4:29 pm
Liquid25677 wrote: Thu Jun 09, 2022 2:34 pm ...
Very strange, I'm getting different results. I also checked manually and I can't find where I'm wrong. These are the terms, o = count, x = don't count, for n = 12
...
You are still having duplicates. For example $8^6 = 4^9 = 262144$.
Oh, that's it! Now I have to find a way to change the code to account for that.
Top
Post Reply

Return to “Clarifications on Project Euler Problems”