We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
First off, I do not want to look at any code what-so-ever. I'm asking for a nudge in the right direction.
In the test cases shown, where do they get 15?
input: 100
output: 15
I guess I am not understanding the problem....
k is the input right? So I need to iterate through every value of n such that 1 < n < k where k = 100?
factors for 100: 100,50,25,20,10,5,4,2,1
Is it asking which of the consecutive positive divisors has the same amount of factors?
Or, is it asking for the first pair of numbers up to 100,
where n is:
nSub1, nSub2, nSub3, ... , nsub97, nsub98, nsub99
2, 3, 4, .... , 97, 98, 99
wanting the first value of n that has the same number of divisors as n+1?
If this is the case, 15 does not make sense to me. Please help!
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #179: Consecutive positive divisors
You are viewing a single comment's thread. Return to all comments →
First off, I do not want to look at any code what-so-ever. I'm asking for a nudge in the right direction.
In the test cases shown, where do they get 15?
input: 100
output: 15
I guess I am not understanding the problem.... k is the input right? So I need to iterate through every value of n such that 1 < n < k where k = 100?
factors for 100: 100,50,25,20,10,5,4,2,1
Is it asking which of the consecutive positive divisors has the same amount of factors?
Or, is it asking for the first pair of numbers up to 100,
where n is:
nSub1, nSub2, nSub3, ... , nsub97, nsub98, nsub99
2, 3, 4, .... , 97, 98, 99
wanting the first value of n that has the same number of divisors as n+1?
If this is the case, 15 does not make sense to me. Please help!