Project Euler

[fugibo]

http://projecteuler.net/

Lots of interesting math/comp. sci. problems.

...it also has proven to me how much I suck at math/programming.

EDIT:

Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.

and my processor is still eating away at #3 and #10 ><

EDIT:
I gave up on #3 for now, my prime number algorithm needs some serious revision. I'm currently taking the factorial of 1,000,000 for my lexicographic permutation prediction algorithm on one core while the other continues to try and find prime numbers up to 2,000,000 (and then add them!).

[Zeriab]

Project Euler can be quite fun ^_^
I did a couple of the problems before becoming bored and doing something else >_>

I suggest implementing Sieve of Eratosthenes where you only look at add number and keep 2 as a special case.
It's a nice and simple algorithm which is good to have.

I don't understand how you can have your processor still eating away at #3 ?_?
The number is so small that you can easily bruteforce it.
My naive Java implementation does the job in less than 50 milliseconds with the only optimization being 2 as a special case and otherwise odd numbers > 2.

[fugibo]

I was staying up really late and I was doing some really stupid stuff. ><

I'd rather work out most of my algorithms myself. Just because I like the challenge, and it makes me feel special. :V

[Aqua]

Lol I've done #1 and #6

[Diokatsu]

Looks boring as fuck.

[winkio]

We actually have a club that does these problems every monday.  I stopped going a while ago, but it's pretty fun stuff.

Looks boring as fuck.

False

[Diokatsu]

Looks boring as fuck.

False

Prove it

[winkio]

Proof: computers

[Zeriab]

Damn you...

Now you made me work on problems there -_-