## Search found 179 matches

- Tue May 18, 2010 4:37 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 289
- Replies:
**26** - Views:
**8034**

### Re: Problem 289

Yup, no hating here either, just made me "O.o" when I saw it the other morning.

- Mon May 17, 2010 10:15 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 289
- Replies:
**26** - Views:
**8034**

### Re: Problem 289

Your post wasn't what piqued my curiosity really, it was more the fact previously there's been about 1 solver per day over the past weeks, yet this weekend popped up 18-20 in a row. It was just odd behavior to see.

- Mon May 17, 2010 7:58 pm
- Forum: News, Suggestions, and FAQ
- Topic: Functional requests
- Replies:
**194** - Views:
**40298**

### Re: Functional requests

Just noted the following, as I'd accidentally closed my forum tab. The other day, I'd temporarily changed my "Allow member contact" status in my profile to "No"; I have no qualms if people PM me on the board, but I prefer not to receive them from random members of the site. Nonetheless, knowing that...

- Mon May 17, 2010 5:03 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 289
- Replies:
**26** - Views:
**8034**

### Re: Problem 289

hrmm... did I blink & all the sudden 20 people solved it this weekend, with only

**zwuupeape**commenting on it?- Fri May 14, 2010 3:22 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 289
- Replies:
**26** - Views:
**8034**

### Re: Problem 289

zwuupeape wrote:Are these correct:

L(4, 25) = 7683575736 --No

L(4, 5) = 6792271756 --No

- Thu May 13, 2010 10:07 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 289
- Replies:
**26** - Views:
**8034**

### Re: Problem 289

I am curious about the number of the solvers, why it is so few? ... Is there something wrong? I'll be honest, I'm rather baffled by it. You can pretty much draw all 37 of the (2,2) scenarios by brute force on a piece of paper, and that should give all the information needed really... I didn't even ...

- Sun Apr 25, 2010 3:50 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 289
- Replies:
**26** - Views:
**8034**

### Re: Problem 289

This problem is the slowest people-solved grower that I can remember in a LONG time. 2 days later, 9 people solved.

- Sun Feb 28, 2010 6:28 am
- Forum: News, Suggestions, and FAQ
- Topic: How do you guys do it?
- Replies:
**3** - Views:
**1700**

### Re: How do you guys do it?

These problems. Do most of you have a strong background in math? For instance do most of you have a lot of math courses? So far I have Calculus 1 and 2 under my belt, and have not yet taken Discrete Math(will be taking it in the summer). Or is most of this common sense stuff? I just want to know wh...

- Thu Feb 25, 2010 3:49 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 043
- Replies:
**11** - Views:
**2350**

### Re: Problem 043

He's our token assembly programmer .

- Wed Feb 24, 2010 10:06 pm
- Forum: Number
- Topic: Squarefree Sets
- Replies:
**4** - Views:
**2309**

### Re: Squarefree Sets

I'm thinking a modulo-2 approach like the method used in finding solutions to the Quadratic Sieve factoring method. I'll write up something better for it shortly. Edit: See the Data Processing section at the bottom of http://en.wikipedia.org/wiki/Quadratic_sieve Edit2: Viewing the exponent-matrix of...

- Tue Feb 23, 2010 11:52 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 273
- Replies:
**35** - Views:
**9524**

### Re: Problem 273

Haha! Just kidding! I've had the correct algorithm for... oh, a month & a half now. Just had the dumbest bug ever. I love life.

- Tue Feb 23, 2010 11:17 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 273
- Replies:
**35** - Views:
**9524**

### Re: Problem 273

So it's been ages since I picked up this problem, and I've got what SHOULD be a water-tight solution written but... as is wont to be the case, it's no-go. Can I get a ninja quick confirmation that the process (as discussed above) for say... all primes 4k+1 [le] 20, we'd be solving for: answer = S(5)...

- Wed Jan 27, 2010 6:19 pm
- Forum: Number
- Topic: Diophantine-ish Equations
- Replies:
**2** - Views:
**2181**

### Re: Diophantine-ish Equations

I'm not really sure what you're asking, but the top of those equations is a very simple geometric series (r=3x), so the tops would be:

((3x)

eg:

(3x+1) = (9x

(9x

(27x

((3x)

^{n}-1)/(3x-1)eg:

(3x+1) = (9x

^{2}-1)/(3x-1)(9x

^{2}+3x+1) = (27x^{3}-1)/(3x-1)(27x

^{3}+9x^{2}+3x+1) = (81x^{4}-1)/(3x-1)- Fri Jan 15, 2010 7:37 pm
- Forum: Programming languages
- Topic: C++, computing with huge numbers and booleans.
- Replies:
**21** - Views:
**8761**

### Re: C++, computing with huge numbers and booleans.

gcc doesn't do 64-bit?stijn263 wrote:Does anyone know a good and free C++ compiler for 64 bit processors? I'm using dev-c++ now, but I think dev-c++ isn't optimized to work on 64-bit processors..

- Fri Jan 15, 2010 7:08 pm
- Forum: Recreational
- Topic: 444
- Replies:
**1** - Views:
**1231**

### Re: 444

210818510677891962 2 is the smallest I've got. The very very brief python code: for x in xrange(30): mn = (10**x*(4444444444444444))**0.5; mx = (10**x*(4444444444444444+1)-1)**0.5; if(mx-mn<1): continue; print "%d\t%d\t%d"%(x,mn,mx); That prints the range of possible numbers that it could fall into....

- Wed Jan 13, 2010 5:12 am
- Forum: Recreational
- Topic: Lambdas...
- Replies:
**9** - Views:
**2857**

### Re: Lambdas...

Yes, there was something about lambdas that they can't do when I was trying to write an algorithm for

Edit: Oh yeah:

lambda i: n+=i;

**Problem 204**(View Problem). I don't remember what the problem was, so I'll look it up. Or it might have been generators...Edit: Oh yeah:

lambda i: n+=i;

- Sun Jan 10, 2010 8:13 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 273
- Replies:
**35** - Views:
**9524**

### Re: Problem 273

Oooh, this is interesting. Apparently I've overlooked something trivial, because I'm going super-crazy on advanced analysis, etc. Time to re-evaluate things. Edit: Well uhh... I only wish I could have been as intelligent as that dude from 7th-century AD. He certainly makes this problem easy, now doe...

- Sat Jan 09, 2010 10:30 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 273
- Replies:
**35** - Views:
**9524**

### Re: Problem 273

Aye, that's what I understood it to mean. Of course, this also means I've gotta use MATHS to figure out how to handle the mammoth S(2515181402329213060851342805). Not going so well so far...

- Thu Jan 07, 2010 11:39 pm
- Forum: Recreational
- Topic: Easy and nice
- Replies:
**13** - Views:
**3960**

### Re: Easy and nice

I would like to see a two liner for this problem. I wonder if it could be done with a Y-Combinator... What IS a Y-Combinator?!??? Wiki is your friend: http://en.wikipedia.org/wiki/Y-combinator It's basically a way of creating recursive functions in purely lambda calculus. The following python examp...

- Thu Jan 07, 2010 8:00 pm
- Forum: Recreational
- Topic: Easy and nice
- Replies:
**13** - Views:
**3960**

### Re: Easy and nice

I wonder if it could be done with a Y-Combinator...zwuupeape wrote:I would like to see a two liner for this problem.