The Project Euler thread

[Reincarnate]

Re: THE project euler thread

congrats FFR4, nicely done

[stargroup100]

Re: THE project euler thread

http://img268.imageshack.us/img268/5532/eulero.jpg

I got 0 eulerian points for this. mad

[iironiic]

Re: THE project euler thread

Got #71 with pencil and paper xD

EDIT: Nice FFREva!

[FFR4EVA_00]

Re: THE project euler thread

http://projecteuler.net/eulerians

"For the twelve most recent problems the difference, d, in the length of time to solve the problem (in minutes) between each member and the slowest in the table is calculated and log2(max(d,2)) points are awarded."
so every time someone solves the problem, the points of everyone who already solved it go up
in other words cosmovibe has 8 points now

[Reincarnate]

Re: THE project euler thread

I suck at this problem pretty hard, admittedly. It's always a split between making some assumption about the composite set (which yields the wrong answer) or trying all possible combinations (too large to run in this lifetime) -- the same problem that's been knocking at me from the beginning of this damn problem -_-

[leonid]

Re: THE project euler thread

don't worry you are not alone

[pmonibuv1]

Re: THE project euler thread

I have 2 answered. Go me! \o/

[XCV]

Re: THE project euler thread

I saw this about a week ago and I'm up to 8 or 9...impressive right? xD

[stargroup100]

Re: THE project euler thread

dude rubix just use my conjectures

they're pretty much correct

here I'll even repost them again

1. A term in a maximal sum subset can never have more than two unique prime factors.
2. When optimizing the sum of a subset by choosing to multiply two powers of primes, the two primes are never both below sqrt(n).
3. For high values of n, no term in a maximal sum subset can be composed of only a single prime factor below sqrt(n) raised to a power, except for values close to sqrt(n).

[iironiic]

Re: THE project euler thread

I got #72 in about two seconds. Only took one line of coding in Mathematica haha. I'll look into the most recent problem when I have more time.

[Reincarnate]

Re: THE project euler thread

dude rubix just use my conjectures

they're pretty much correct

here I'll even repost them again

1. A term in a maximal sum subset can never have more than two unique prime factors.
2. When optimizing the sum of a subset by choosing to multiply two powers of primes, the two primes are never both below sqrt(n).
3. For high values of n, no term in a maximal sum subset can be composed of only a single prime factor below sqrt(n) raised to a power, except for values close to sqrt(n).

I'm aware of all these -- it doesn't address the problem I'm having unfortunately

[Reincarnate]

Re: THE project euler thread

omfg



Unfortunately had to do some manual work (it COULD be automated but it just wasn't worth the headache)

[stargroup100]

Re: THE project euler thread

gj

right now I'm workin on uh, 351 I believe

the only roadblock I ran into is the fact that the summatory of the euler totient function is retardedly slow to calculate for very high values

if I can find an easy way to compute that then I have my answer

[Reincarnate]

Re: THE project euler thread

Actually SG the totient function is fine for that problem (that's what I used and I solved it earlier today) -- you just need a more efficient function

[stargroup100]

Re: THE project euler thread

for the summation of totient? really?