Problem 601

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
FourLegsDriveCat
Posts: 21
Joined: Tue Sep 11, 2012 8:18 pm
Location: Ukraine

Problem 601

Post by FourLegsDriveCat » Mon Dec 02, 2019 4:16 pm

Hi,
It's rather suggestion, not clarification.
Problem says:
the smallest positive integer k such that n+k is not divisible by k+1
Since k starts from 1, the following examples seem unnecessary:
13 is divisible by 1
120 is divisible by 1

User avatar
jaap
Posts: 542
Joined: Tue Mar 25, 2008 3:57 pm
Contact:

Re: Problem 601

Post by jaap » Tue Dec 03, 2019 6:51 am

I disagree. $k$ is essentially the length of the streak, i.e. how many consecutive lines in the two examples have divisibility before the line where it is no longer divisible. Like a lucky streak, it is about how long you can keep it going before your luck runs out. The divisibility by 1 is part of that, regardless of the fact that a streak can never have length zero.

User avatar
FourLegsDriveCat
Posts: 21
Joined: Tue Sep 11, 2012 8:18 pm
Location: Ukraine

Re: Problem 601

Post by FourLegsDriveCat » Tue Dec 03, 2019 7:01 am

OK, makes sense, just confusing a bit when first read.

Post Reply