## Search found 23 matches

- Sun Feb 26, 2012 5:54 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 371
- Replies:
**39** - Views:
**17770**

### Re: Problem 371

I am having issues with precision. Can somebody suggest me how to get over the problem of precision. I have tried logarithm-antilogarithm to approximate but it does not give correct answer.

- Tue Oct 04, 2011 3:18 pm
- Forum: News, Suggestions, and FAQ
- Topic: Engineering Opportunities at Google (PE)
- Replies:
**4** - Views:
**3442**

### Engineering Opportunities at Google (PE)

Following is what I received from a person called Adam Cress. This looks fishy and therefore wondering how many you received a similar message through PE. You have received the following message from GoogleWantsYou at Project Euler: Hi, My name is Adam Cress, I'm engineering recruiter at Google. A c...

- Sat Jan 30, 2010 10:59 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 272
- Replies:
**15** - Views:
**9936**

### Re: Problem 272

hey no problem!

I learned lot of new and interesting things and finally came up with faster and better algorithm.

I learned lot of new and interesting things and finally came up with faster and better algorithm.

- Sat Jan 30, 2010 10:17 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 272
- Replies:
**15** - Views:
**9936**

### Re: Problem 272

Thanks zwuupeape for reply. Can you please recheck the value because I am getting the same answer (for 3*10^8) with a completely different algorithm (semi brute force).

- Sat Jan 30, 2010 6:10 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 272
- Replies:
**15** - Views:
**9936**

### Re: Problem 272

Somebody please confirm if the answer is 19543219365706 for n <= 3*10^8.

Thanks.

Thanks.

- Wed Jan 06, 2010 1:03 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 256
- Replies:
**11** - Views:
**5404**

### Re: Problem 256

Someone please confirm the following results:

smallest s such that

T(s) = 20 is 30240

T(s) = 40 is 327600

T(s) = 160 is xxxx

T(s) = 180 is xxxx

Thanks.

smallest s such that

T(s) = 20 is 30240

T(s) = 40 is 327600

T(s) = 160 is xxxx

T(s) = 180 is xxxx

Thanks.

- Fri Dec 25, 2009 9:08 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 258
- Replies:
**23** - Views:
**9910**

### Re: Problem 258

Thanks zwuupeape. Is it possible to solve this question in less than 1 min? I need to perform around 70*2000 3 operations and I don't think python can perform this many operations with in 1 min. Even after optimization I can reduce total operations to 70*2000 2.8 which again is not enough to solve t...

- Fri Dec 25, 2009 6:58 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 258
- Replies:
**23** - Views:
**9910**

### Re: Problem 258

Can somebody please confirm my result. For

g

g

I got g

g

_{k}= 1 for k = 0 to 14g

_{k}= (g_{k-14}+ g_{k-15}) mod 10^6 for k>= 15I got g

_{10^18}= 336460- Sat Nov 21, 2009 4:43 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 223 & 224
- Replies:
**22** - Views:
**10438**

### Re: Problem 223 & 224

Can somebody please confirm the number of solutions for perimeter < 10^4 is equal to 13656

- Sat Apr 11, 2009 2:15 pm
- Forum: Combinatorics
- Topic: Constrained walk
- Replies:
**1** - Views:
**2870**

### Constrained walk

what are the total number of ways to toss a coin n times s.t. | no of heads - no. of tails | < k at each stage.? where k is an integer lies between 1 and n. This question has strong resemblance with catalan number which is total number of ways to toss a coin s.t (no. of heads - no. of tails) > 0 at ...

- Sat Mar 21, 2009 1:13 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 155
- Replies:
**17** - Views:
**7762**

### Re: problem 155

Thanks Tommy. I really cannot understand the problem with my algorithm. Is D(10) = 2491.

- Sat Mar 21, 2009 12:49 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 155
- Replies:
**17** - Views:
**7762**

### Problem 155

Can anybody please confirm me if the values D(4) = 15 and D(5) = 35 are correct.

thanks in advance.

thanks in advance.

- Thu Feb 12, 2009 8:57 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 213
- Replies:
**50** - Views:
**13916**

### Re: Problem 213

I am sure that my algorithm is correct but I am still not getting the right answer. Can anybody please tell me if I am correct for the following values: expected empty cells for 4X4 after 2 tolls are 4.86548889746 and after 50 tolls are 4.93827160494 in case of 20X20 after 50 tolls expected empty ce...

- Thu Feb 12, 2009 8:02 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 213
- Replies:
**50** - Views:
**13916**

### Re: Problem 213

As pointed earlier, the expected number of empty square after one toll is equal to 1 in case of 2X2 grid. Will it remain the same forever(i.e. remains 1 irrespective of number of tolls).

- Sun Jan 11, 2009 12:38 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 210
- Replies:
**70** - Views:
**26127**

### Re: problem 210

I have checked my program and I found a small error, but still I am unable to get the correct answer. Can someone please tell me if I am correct this time.

N(1000) = 1597880

N(10000) = 159814790

N(100000) = 15981722482

N(1000000) = 1598174519142

N(1000) = 1597880

N(10000) = 159814790

N(100000) = 15981722482

N(1000000) = 1598174519142

- Sat Jan 10, 2009 7:55 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 210
- Replies:
**70** - Views:
**26127**

### problem 210

Can somebody please confirm the answer for N(1000). my answer is 1597548.

thanks in advance.

thanks in advance.

- Mon Aug 11, 2008 4:50 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 192
- Replies:
**36** - Views:
**13075**

### Re: prob-192(best rational approx)

thanks david,

Finally I get the right answer of the question. The precision involved in this particular question really screwed me. Initially I thought the problem was with my algorithm but the actual problem was with my precision which should atleast be equal to 60 decimal places.

Finally I get the right answer of the question. The precision involved in this particular question really screwed me. Initially I thought the problem was with my algorithm but the actual problem was with my precision which should atleast be equal to 60 decimal places.

- Mon Aug 11, 2008 3:49 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 192
- Replies:
**36** - Views:
**13075**

### Re: prob-192(best rational approx)

is the answer to my question = 561480917932597

- Sun Aug 10, 2008 5:33 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 192
- Replies:
**36** - Views:
**13075**

### prob-192(best rational approx)

can any one please confirm the answer for 1 <n <=1000

the answer generated by my program is equal to 610031050010701

thanks in advance

the answer generated by my program is equal to 610031050010701

thanks in advance

- Wed Jun 11, 2008 11:04 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 159
- Replies:
**18** - Views:
**8335**

### Re: problem 159

finally I got it.