Project Euler

So yeah, I found this website today. Amazing site, with problems which has a lot to do with maths and logical thinking, and also programming too.

I hereby give you Project Euler.

So, where are you in this world of problems? Do you have any questions, or need help, or something?

Well, at least I am at problem 5 now. However, I started for 30 minutes ago, so don't think I'm a noob just yet.

I really hate mathematics. xD
But yeah, this is the kind of thing I was talking about getting here. I don't think I know enough programming to answer most of these though, and they would take years of solving by hand. >_>

I really hate mathematics. xD
But yeah, this is the kind of thing I was talking about getting here. I don't think I know enough programming to answer most of these though, and they would take years of solving by hand. >_>

Actually, he has the one minute rule. Any of the mathematical problems there can be solved in one minute by a modest computer processor.

is the answer to the first question

 Spoiler

233168

if so i got it in less than 2 minute with all the programming and stuff o.O

Ooh, looks interesting.

I'm on the wrong computer now though, and I have stuff to do anyway. I'll check it out later, I guess.

is the answer to the first question

 Spoiler

233168

if so i got it in less than 2 minute with all the programming and stuff o.O

Yup. I did it as well in less than 2 minutes though, without my comp. Since it's series(3 and 5), it's easy to take it on paper as long you know series-formulas and remember that there are numbers that appear in both series and have to be fixed.

Yeah, I did the first, fifth, and sixth on paper. I have no clue how to work with BigIntegers or prime numbers, so I gave up on number 3.

For some reason, 600851475143 is a real. And trunc(600851475143) doesn't work either >_>

So I just translated my code to Javascript (which doesn't give a cucumber about variable types), stuck it in a blank HTML file, and got the right answer. Lol.

1-3, 5-7, how the heck do you do 4?

Yeah, I did the first, fifth, and sixth on paper. I have no clue how to work with BigIntegers or prime numbers, so I gave up on number 3.

You can make the fact up on these statements:
- Every prime over 4 (that is, all primes but 2 and 3) can be written as:
6k + 1 or
6k - 1
(NB: not every number written as 6k+-1 is a prime)
- All primes but 2 is odd.
- All odd numbers are not able to divide by any number higher than the square root of the number.

For some reason, 600851475143 is a real. And trunc(600851475143) doesn't work either >_>

So I just translated my code to Javascript (which doesn't give a cucumber about variable types), stuck it in a blank HTML file, and got the right answer. Lol.

1-3, 5-7, how the heck do you do 4?

4 is easy brute force. Convert the number to an uint/byte-array and check if the first number equals the last, then the second first to the second last and so forth...

Woops. I read Project Eraser.

Sounds much more fun than Project Euler.