Problem 1008

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
jj_rabeyrin
Posts: 1
Joined: Sat Feb 27, 2021 9:05 pm

Problem 1008

Post by jj_rabeyrin »

I'm probably doing a stupid mistake but i don't understand the example (2,7).
Why Q(x) = x^2 would not be ok /better ?
then Q(n^2 ) = n^4
and n^4 = n mod 7 for n=0,1,2.

Any advice of what i'm missing please?
Icy
Posts: 35
Joined: Sat Jan 14, 2012 11:03 pm

Re: Problem 1008

Post by Icy »

You're not missing anything. It's a genuine error/typo with the problem statement. As evidenced by the example, the authors wanted the functional inverse to be monic with prescribed degree $N+1$, i.e. the coefficient of $x^{N+1}$ has to be 1.
Post Reply