Problem 627

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
khalil_fazal
Posts: 3
Joined: Mon Jan 23, 2017 6:27 am

Problem 627

Post by khalil_fazal »

I think it's trivial to show that $m\geq n$ otherwise $S=\emptyset$.
Therefore I think there is a typo and that we are meant to instead find $F(10^4+1, 30) \mod {10^9+7}$.
Image
Top
mdean
Posts: 206
Joined: Tue Aug 02, 2011 2:05 am

Re: Problem 627

Post by mdean »

Nowhere does it say the x's need to be distinct. The easiest example of a possible product is 1. I see nothing to suggest a mistake in the problem.
Image
Top
khalil_fazal
Posts: 3
Joined: Mon Jan 23, 2017 6:27 am

Re: Problem 627

Post by khalil_fazal »

My mistake, thanks.
Image
Top
Post Reply

Return to “Clarifications on Project Euler Problems”