. /../Project Euler/ 1
written by Bgreman on Jul 05, 2007 23:24
We have a ton of programmers here, and a fair few mathematicians. So here we can talk about Project Euler, a bunch of exercises in programming and mathematics. If you're registered, you can view my profile here.
└> last changed by Bgreman on July 06, 2007 at 20:11
written by Ireclan on Jul 06, 2007 00:34
The link to your profile does not work. As far as project Euler, it sounds like something I would not take the slightest interest in, merely because my tastes differ from yours (and I've grown intellectually lazy over the years). Sorry if I've "rained on your parade", so to speak.

On a side note, I'd like to say that Mr. Euler is in quite a fetching outfit. He was a mathematician, I presume?
written by Barebones on Jul 06, 2007 07:26
The profile link works only if you're registered and logged-in, apparently.

This looks cool (for the nerdy type), thanks for the link.

Edit: <nerdyness>Problem 1 can be solved by a one-line main program plus a one-line function.</nerdyness>
written by Naavis on Jul 06, 2007 08:37
Hmm, judging by a quick glance the project seems nice. Thanks for the link, Brock.
electronic engineer!
written by Leniad on Jul 06, 2007 14:46
Solved 6 problems already!

Looks very nice.

BTW: Problem 5 can be solved without programming at all
written by Barebones on Jul 06, 2007 15:24
s/programming/using a calculator/

P.S.: I wonder if it's "legal" to use Linux shell scripts. Problem 3 could be solved just by
factor 317584931803 | awk '{print $NF}'
└> last changed by Barebones on July 06, 2007 at 16:10
written by Barebones on Jul 10, 2007 20:50
*mini bump*

In problem 14, you can realize that the first rule, the step n -> n/2, is a sort of normalization step; without it, the Collatz Problem becomes, "show that the sequence n -> (3n+1) * 2^p, where 2^p is the lowest 1-bit of n, eventually lead to n being a power of two". In this light, the problem becomes more interesting and, I think, more simple to analyze.
written by Naavis on Jul 10, 2007 21:12
I just did it with brute force, by trying out all the sequences.
written by Barebones on Jul 11, 2007 06:52
And I'll probably end up doing the same; if I completed it analytically, I'd have solved a problem (Collatz's) which has been unsolved since 1937, actually. I just point out that there is more to it than what surfaces.
written by Bellum on Jul 18, 2007 13:43
*sigh* I suck.
reading this thread
no members are reading this thread
. /../Project Euler/ 1
25065, 11 queries, 0.062 s.this frame is part of the AnyNowhere network