I'm trying to solve this problem. Initially I figured out a brute force algorithm would'nt work then I saw this method for calculating the numbers of divisors. Howewer even that gets slower after 300. I thought about calculating the divisors of a number and its subsequent (since a triangular number = n*(n+1)/2 ) and try to workout a formula to get the divisors a triangular number from that, or try to work out a lower bound for numbers that have at least 500 factors.hk wrote: Sat May 13, 2017 12:55 pm If you're still stuck with this problem you might look at :number of divisors or number of divisors
Problem 012
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.
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
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
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.
-
Liquid25677
- Posts: 9
- Joined: Thu May 26, 2022 4:07 pm