## Search found 179 matches

- Thu Sep 17, 2009 5:50 pm
- Forum: News, Suggestions, and FAQ
- Topic: To those who achieved 100%
- Replies:
**28** - Views:
**12404**

### Re: To those who achieved 100%

Surprising answer from stjin... 88 is not difficult at all compared to 177 or 143 (not solved). At that time I usually tried to solve the new problems immediately, and every now and then I solved an older one. I also think 177 is harder than 88, but I just hadn't looked at problem 88 that close ;-)...

- Wed Sep 16, 2009 2:21 pm
- Forum: News, Suggestions, and FAQ
- Topic: New wait time system.
- Replies:
**85** - Views:
**21049**

### Re: New wait time system.

With that said, would you count looking at Sloane after spotting a pattern as cheating? Well, it all depends upon what you're looking up... for example, if you plug in the first N answers to a problem, and use that to find the correct answer... well that's obviously cheating. However, there are cas...

- Tue Sep 15, 2009 10:09 pm
- Forum: News, Suggestions, and FAQ
- Topic: To those who achieved 100%
- Replies:
**28** - Views:
**12404**

### Re: To those who achieved 100%

Looking back, I popped my 100% cherry on

**Problem 184**(View Problem). That &**Problem 177**(View Problem) kept me trying for a LONG time.- Wed Aug 12, 2009 7:29 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 205
- Replies:
**27** - Views:
**11667**

### Re: Problem 205

I have worked out a solution that gives the correct answer to the example in this thread, as well as provides the correct probabilities of each roll for each player, but it keeps saying that my answer is wrong. Can someone at least confirm that the number of possible outcomes is (4^4)*(6^6)=1194393...

- Mon Aug 10, 2009 5:50 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 006
- Replies:
**21** - Views:
**5273**

### Re: Problem 6 error

the problem is asking: Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum. which results in a negative value. the problem should be reformulated to: Find the difference between the square of the sum of the first one hundred natural ...

- Mon Aug 10, 2009 5:47 pm
- Forum: News, Suggestions, and FAQ
- Topic: New wait time system.
- Replies:
**85** - Views:
**21049**

### Re: New wait time system.

While they could work for many problems, there are also a large number of PE problems that depend on a very strict input set. For example, considerrlindley wrote:<randomization of the inputs of PE problems>

**Problem 236**(View Problem).

- Mon Aug 10, 2009 4:39 pm
- Forum: News, Suggestions, and FAQ
- Topic: Functional requests
- Replies:
**194** - Views:
**40298**

### Re: Functional requests

I would've thought you were more likely to offer writing one or two overviews rather than requesting one for a special problem :lol: Haha, yeah. Personally, I'd love to be able to contribute to the PDF writing process, but my technical math background is shockingly limited -- I'm more of a intuitiv...

- Thu Aug 06, 2009 6:26 pm
- Forum: News, Suggestions, and FAQ
- Topic: Functional requests
- Replies:
**194** - Views:
**40298**

### Re: Functional requests

Could you (anybody who wants) give a short list (five items or so) which problems you'd most want a pdf for? I think the only one that's still burning a hole in my head is Robert_Gerbicz 's remarkable solution for 184. I swear I've looked over it a dozen times and I don't think I'm even close to gr...

- Sun Jul 26, 2009 6:31 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 244
- Replies:
**11** - Views:
**2980**

### Re: Problem 244

i kinda got stuck here,i have found a solution which appear to be minimal with path length of 47(or 46) however whats make the situation wierd is that if i eliminate cycles and already seen boards i find only one solution,and if i wont there are just too many solutions and the problem cant be solve...

- Sun Jul 26, 2009 3:49 pm
- Forum: Number Theory
- Topic: Concatenated Primes
- Replies:
**9** - Views:
**4317**

### Re: Concatenated Primes

Nope. But you can have a kludgey workaround as follows:elendiastarman wrote:Well, for some weird reason, pow(a,b,m) only works when the math module hasnotbeen imported . Anyone know a way to "unimport" a module?

Code: Select all

```
pow2 = pow
from math import *
print pow2(2,3,3)
```

- Sat Jul 18, 2009 3:19 am
- Forum: News, Suggestions, and FAQ
- Topic: New wait time system.
- Replies:
**85** - Views:
**21049**

### Re: New wait time system.

Just as a bit of a devil's advocate, I remember absolutely plowing through solutions for at least ~100 or so problems in trivial time when I was just starting the site. It wasn't until I got into the real cleverly designed stuff of 150+ where things began to slow down dramatically. While there were ...

- Fri Jul 17, 2009 5:22 am
- Forum: Number Theory
- Topic: Concatenated Primes
- Replies:
**9** - Views:
**4317**

### Re: Concatenated Primes

Hmmm....I should have easily found that, but my program in python balks at while loops for some reason...(the square root is getting too big for a simple "for" loop). I implemented the Miller-Rabin method for use with larger numbers, but....to my surprise, trial division is faster for large numbers...

- Mon Jul 06, 2009 6:13 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 167
- Replies:
**32** - Views:
**9528**

### Re: Problem 167

I found the pattern (although I have no idea why it works). It's fine for some values of n, not for others. Is there a pattern in the patterns? some n's are far more difficult than others, obviously - but how much more difficult? Are there many people who solved it for some n but not others? Out of...

- Thu Jul 02, 2009 1:14 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 245
- Replies:
**16** - Views:
**5644**

### Re: Problem 245

You should be able to use modulus to test legitimacy of your answers & not need to use doubles.

if ((n - 1) % (n - tot) == 0):

success

if ((n - 1) % (n - tot) == 0):

success

- Sun Jun 28, 2009 4:45 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 251
- Replies:
**15** - Views:
**6491**

### Re: Problem 251

^{3}[radic]-x = -

^{3}[radic]x

As ed_r mentioned...

- Fri Jun 26, 2009 10:00 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 070
- Replies:
**24** - Views:
**7269**

### Re: Problem 070

I have done this problem a thousand different ways and I keep finding that <values> is the smallest ratio? Did anybody else get this or is it just me? That is incorrect. There are smaller ratio(s) (I have no idea how many, I just confirmed it wasn't the smallest). Might want to erase your numbers t...

- Sat Jun 20, 2009 2:48 am
- Forum: News, Suggestions, and FAQ
- Topic: Multiple Programming Languages
- Replies:
**14** - Views:
**3372**

### Re: Multiple Programming Languages

I think these is no need to have a language track for each user. But it will be interesting to have a language statistics for each problem. When you submit an answer, you can choose the language in the combo-box blow the input field. The default value in the combo-box will be the language in your p...

- Sun Jun 07, 2009 3:50 am
- Forum: News, Suggestions, and FAQ
- Topic: Multiple Programming Languages
- Replies:
**14** - Views:
**3372**

### Re: Multiple Programming Languages

You... use prolog for PE problems?

I'm going to need to lie down for a while I think...

I'm going to need to lie down for a while I think...

- Sun Jun 07, 2009 3:49 am
- Forum: Recreational
- Topic: How to freeze number of problems I've solved
- Replies:
**1** - Views:
**1038**

### Re: How to freeze number of problems I've solved

Nope! Unless you made an alt, but that's mildly frowned upon.

- Mon May 25, 2009 3:53 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 244
- Replies:
**11** - Views:
**2980**

### Re: Problem 244

Well, you've already finished the problem so you know the solution, but if that sort of wording comes up in the future the intent was, I'm sure, the first; all the checksums of solutions of length N (where N is the minimum length).