I remember that when I had a look at Euler 1 I found that there's a fun solution that should run in "constant" time.

You can find the sum of the multiples of 3, add the multiples of 5, and then subtract the multiples of 3*5.

Is that the kind of thing you're looking for?

 - Lyndon

On Wed, Jan 28, 2015 at 10:57 AM, Jean Lopes <hawu.bnu@gmail.com> wrote:

I'm not really good at math, maybe I am missing something obvious ?

Maybe some pointers as of where to start studying math in order to avoid this brute force attempts, at least to help in this particular problem

2015-01-27 21:38 GMT-02:00 Brandon Allbery <allbery.b@gmail.com>:

On Tue, Jan 27, 2015 at 6:29 PM, Jean Lopes <hawu.bnu@gmail.com> wrote:

The problem to be solved: https://www.hackerrank.com/contests/projecteuler/challenges/euler001

It's worth remembering that the Euler problems are all about math understanding; often they are designed such that brute force solutions will time out or otherwise fail.

--

brandon s allbery kf8nh                               sine nomine associates

allbery.b@gmail.com                                  ballbery@sinenomine.net

unix, openafs, kerberos, infrastructure, xmonad        http://sinenomine.net

_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://www.haskell.org/mailman/listinfo/beginners

_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://www.haskell.org/mailman/listinfo/beginners

_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://www.haskell.org/mailman/listinfo/beginners