## Search found 18 matches

- Fri Feb 26, 2016 6:00 am
- Forum: News, Suggestions, and FAQ
- Topic: Dark Theme
- Replies:
**0** - Views:
**1079**

### Dark Theme

What happened to the dark theme? I really liked it and hate staring at all this white.

- Mon Nov 05, 2012 4:07 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 388
- Replies:
**11** - Views:
**4004**

### Re: Problem 388

I had the same problem as the OP. I think that the words "from" and "to" imply endpoints (at least for me they did). Also, something else seems weird about the wording, but I can't put my finger on it.

- Wed Mar 23, 2011 6:29 pm
- Forum: Recreational
- Topic: 1 second rule
- Replies:
**12** - Views:
**5434**

### Re: 1 second rule

Really? Would you care to challenge us with an example then?hk wrote:Not all problems can be solved within a second though, even with the best algoritm.

In fact every problem can be solved within a minute using a compiled language.

- Wed Mar 23, 2011 5:55 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 070
- Replies:
**24** - Views:
**7507**

### Re: Problem 070

I'm not sure what to do about this, but I believe I might have a significant contribution for this problem and problem 72. For 70, I get these times: Upper bound 10^7: about .6 seconds Upper bound 99999900: about 6 seconds For 72: Upper bound 10^6: .05 seconds Upper bound 10^7: .60 seconds Upper bou...

- Mon Mar 21, 2011 12:01 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 329
- Replies:
**16** - Views:
**4978**

### Re: Problem 329

I think I'm close. My random generator is slightly off from my proper solution though. Are these correct:

Probability of "P" == 119/300

"PP" == 230/1497

"PNPN" == 21271/322704

Probability of "P" == 119/300

"PP" == 230/1497

"PNPN" == 21271/322704

- Sat Mar 19, 2011 10:06 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 100
- Replies:
**57** - Views:
**14984**

### Re: Problem 100

You probably have a precision problem. In Windows Calculator I get:

0.49999999999999999998596550493372

Edit: Try thinking of a way to do the problem so that precision is not even a factor. You'll just need to find the pattern.

0.49999999999999999998596550493372

Edit: Try thinking of a way to do the problem so that precision is not even a factor. You'll just need to find the pattern.

- Fri Mar 18, 2011 1:30 am
- Forum: News, Suggestions, and FAQ
- Topic: Total Beginner
- Replies:
**8** - Views:
**4591**

### Re: Total Beginner

I vote for C++. I must say I'm a little biased though. Here's another tutorial: http://www.cplusplus.com/doc/tutorial You'll also need to download an IDE. I don't know any that would definitely work for Ubuntu. Try googling. Almost any language would work for Project Euler. If you like the look of C...

- Tue Mar 15, 2011 4:19 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 313
- Replies:
**21** - Views:
**6879**

### Re: Problem 313

Got the answer. My first method was based on a false assumption. I didn't have my compliler so I had to use codepad to test the code. Still a very easy, but still satisfying problem.

One more till L3

One more till L3

- Sun Mar 13, 2011 7:47 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 313
- Replies:
**21** - Views:
**6879**

### Re: Problem 313

My method doesn't generate pairs, just the number of solutions for each p 2 . Based on my methods, though, the pairs should be S(2, 7), S(3, 6), S(4, 5), S(5, 4), S(6, 3), S(7, 2). I feel like I might be giving away too much. Edit: Hm, maybe not. S(7, 2) doesn't seem to give 25 if I do it by hand, I...

- Sun Mar 13, 2011 2:17 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 313
- Replies:
**21** - Views:
**6879**

### Re: Problem 313

I've refined my methods, but now I am getting 16442. I notice that it is very close to 3 times the example case, but I'm guessing it's just coincidence. Can you tell me how much these numbers are off by? p 2 = 9, solutions = 2 p 2 = 25, solutions = 6 p 2 = 361, solutions = 90 p 2 = 1849, solutions =...

- Sat Mar 12, 2011 3:31 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 313
- Replies:
**21** - Views:
**6879**

### Re: Problem 313

I tried this problem today and quickly found a generating function (I think). My C++ code is 30 lines long. This problem seems way too easy to be 300+, at least the way I'm approaching it. Could it really be that simple? Also, are S(314, 272) and S(272, 314) considered distinct. Logically it seems t...

- Mon Mar 07, 2011 3:06 am
- Forum: Resources
- Topic: Paper/Pencil Problems
- Replies:
**71** - Views:
**56644**

### Re: Paper/Pencil Problems

Problem 207 (view problem) is one of the easier ones on paper I think.

- Fri Mar 04, 2011 11:22 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 317
- Replies:
**38** - Views:
**11813**

### Re: Problem 317

Hello, I did this problem with pencil/paper and figured the final anwer with my TI-83. I think there's a chance I lost accuracy by using the calculator. I think my method is correct, but I made one assumption in my calculus. That could also be the problem. Could I pm someone to see if my answer is c...

- Tue Feb 08, 2011 5:48 pm
- Forum: Clarifications on Project Euler Problems
- Topic: problem 055
- Replies:
**31** - Views:
**8427**

### Re: problem 055

I think the wording should be changed to "How many probable Lychrel numbers are there below ten-thousand?"

If a number satisfies the conditions presented int the question then the number is a probable Lychrel number.

None are actually known to exist.

If a number satisfies the conditions presented int the question then the number is a probable Lychrel number.

None are actually known to exist.

- Mon Jan 31, 2011 2:29 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 144
- Replies:
**20** - Views:
**7412**

### Re: Problem 144

Coordinates to the nearest hundredth are as follows:

second: (-3.99, -6.02)

ninth: (3.29, 7.53)

thirty-third: (-4.10, -5.74)

second: (-3.99, -6.02)

ninth: (3.29, 7.53)

thirty-third: (-4.10, -5.74)

- Sat Jan 22, 2011 2:37 am
- Forum: Programming languages
- Topic: c++ numbers out of range
- Replies:
**9** - Views:
**6197**

### Re: c++ numbers out of range

Thank you for your replies. I did enjoy coming up with an algorithm for those problems. I realize it would be ridiculous to try 97 with bignums.

- Sat Jan 22, 2011 2:28 am
- Forum: News, Suggestions, and FAQ
- Topic: Fastest Solvers
- Replies:
**21** - Views:
**9630**

### Re: Fastest Solvers

I like the Eulerlians section, but it seems a shame that previous bests aren't recognized somewhere. How about a page for the top 100 highest scores with the best rank achieved

Example:

Name: Anton_Lunyov

Highest score achieved: 177

Highest rank achieved: 1

Example:

Name: Anton_Lunyov

Highest score achieved: 177

Highest rank achieved: 1

- Thu Jan 20, 2011 2:24 am
- Forum: Programming languages
- Topic: c++ numbers out of range
- Replies:
**9** - Views:
**6197**

### Re: c++ numbers out of range

Welcome to PE latinpower! C++ also has 64-bit integers ("long long" or "__int64" depending on which implementation you use). As a principle, you don't need any bigInt or bigNum libraries to solve the PE problems (but you do need to know the limitations imposed by each type and take those limitation...