## Search found 165 matches

- Mon Nov 16, 2015 11:34 pm
- Forum: Resources
- Topic: Translating all problems to German
- Replies:
**9** - Views:
**13197**

### Re: Translating all problems to German

Hi projecteuler Team, I wanted to ask if there is still a need for german translations? Projekt Euler currently shows 110 problems. If you want to contribute, visit their site and use the contact form to submit a problem. Philipp should be really quick to send a reply and implement your suggestion.

- Fri Oct 23, 2015 12:33 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 288
- Replies:
**14** - Views:
**5427**

### Re: Problem 288

Очень хорошо

- Thu Oct 22, 2015 10:21 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 288
- Replies:
**14** - Views:
**5427**

### Re: Problem 288

Typo. Wrong Index. T should start with [10, ...]. Apart from that aforementioned minor hiccup I have a more severe problem concerning my understanding of the problem. It's about "Let NF(p, q) be the number [...]". Would someone be willing to hear me about it? Privately of course, since I don't want ...

- Thu Oct 22, 2015 10:02 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 288
- Replies:
**14** - Views:
**5427**

### Re: Problem 288

The first 10 Tn with p = 61 are [7, 30, 13, 59, 40, 50, 30, 31, 58, 17].

Is this correct?

Is this correct?

- Tue Oct 20, 2015 8:16 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 165
- Replies:
**41** - Views:
**13788**

### Re: Problem 165

Thanks for clearing this hk! IMHO I've built a "fool-proof" algorithm, although we all know: Build a system that also a fool can use, and only fools will use it. Anyway... I'm in the process of eliminating flaws in my algorithm, going from top to bottom. Could anyone confirm Points[0..4] = [(27, 144...

- Sat Oct 17, 2015 12:52 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 228
- Replies:
**6** - Views:
**2288**

### Re: Problem 228

It seems that working with single precision floats obviously isn't the way to go. Will double precision suffice?

- Thu Oct 15, 2015 12:44 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 228
- Replies:
**6** - Views:
**2288**

### Re: Problem 228

According to the description S 3 + S 4 should give a polygon with 6 vertices. The algorithm I'm using gives 7 vertices. Here's some raw data for the example. Maybe someone can make something out of it? S3 = [(-0.952413, -0.304811), (-0.59846, -0.801153), (-0.0220966, -0.999756)] S4 = [(0.525322, 0.8...

- Wed Oct 07, 2015 11:13 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 157
- Replies:
**21** - Views:
**8066**

### Re: Problem 157

Brute-force aside, I'm positively sure I've found the pattern in this. Alas my numbers seem incorrect. Would anyone mind to hear me about this, and either support or decline my thoughts?

- Sun Oct 04, 2015 11:06 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 283
- Replies:
**7** - Views:
**3002**

### Re: Problem 283

So does 6-8-10 count as one or two? 8-6-10 should be valid, too.

- Sun Oct 04, 2015 2:16 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 283
- Replies:
**7** - Views:
**3002**

### Re: Problem 283

It's not explicitly mentioned in the description, but I assume -like in other problems- the side lengths are given with a <= b <= c.

Is this so?

Is this so?

- Fri Sep 25, 2015 11:09 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 111
- Replies:
**28** - Views:
**6088**

### Re: Problem 111

Finally owned this one. For those who are still seeking, OPs table proved a valuable asset for debugging. N(10, 2) and N(10, 8) are indeed incorrect. But once you have the others you will easily find N() for d = 2 and 8.

- Sun Sep 20, 2015 8:08 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 111
- Replies:
**28** - Views:
**6088**

### Re: Problem 111

Thanks a lot for clearing this! I guess I wasn't the only one who took "consecutiv" for "repeated".

- Sun Sep 20, 2015 2:59 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 111
- Replies:
**28** - Views:
**6088**

### Re: Problem 111

Ok. Which also bothers me is -from the table- N(10,0)=8. Since M(10,0)=9 there should be 8 primes with 10 digits containing 9 zeros. Is that right? The only 10-digit primes with 8 zeros I could find are 1000000007 and ...9.

- Sun Sep 20, 2015 2:27 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 111
- Replies:
**28** - Views:
**6088**

### Re: Problem 111

Hmm... Shouldn't that be the matter with N? Just like in the description M(4,1) = 3, but N(4,1) = 9. A 4-digit prime has at most 3 consecutive 1s, and 9 primes having 4 digits contain 3 repeated 1s. So I figured M() is about the maximum number of consecutive digits d.

- Sun Sep 20, 2015 10:13 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 111
- Replies:
**28** - Views:
**6088**

### Re: Problem 111

Can anyone confirm my suspicions?

- Sat Sep 19, 2015 8:27 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 111
- Replies:
**28** - Views:
**6088**

### Re: Problem 111

OP wrote: [...] d M(10,d) N(10,d) ------------------------------- 0 8 8 1 9 11 2 8 34 3 9 7 4 9 1 5 9 1 6 9 1 7 9 9 8 8 24 9 9 8 Should this table be correct? I'm being quite dazzled. M(10, 0) = 8 seems trivial, but the only n for which I get M(n, d) = 9 are 4, 5, 6, 7. I've already checked factoriz...

- Fri Sep 11, 2015 8:47 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 273
- Replies:
**35** - Views:
**10133**

### Re: Problem 273

@PhilLeTaxi: I'm trying to avoid big integers, which may not be necessary at all. Some old Indian certainly knew the answer I'm sticking with his way right now.

- Thu Sep 03, 2015 7:16 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 273
- Replies:
**35** - Views:
**10133**

### Re: Problem 273

I suspect these are elements 1 to 5 of N ... [1, 5, 13, 17, 29]?

- Wed Sep 02, 2015 10:55 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 184
- Replies:
**62** - Views:
**20940**

### Re: Problem 184

With all the coordinates from I

Is that correct?

[edit]

In the above calculations I've left out the center at (0, 0), since it's not a valid vertex.

_{2}one can form (not necessarily valid) 56 triangles, with those from I_{3}2024 and from I_{7}776216.Is that correct?

[edit]

In the above calculations I've left out the center at (0, 0), since it's not a valid vertex.

- Mon Aug 10, 2015 6:42 pm
- Forum: Number
- Topic: nth Root Algorithm
- Replies:
**2** - Views:
**7765**

### Re: nth Root Algorithm

This is embarassing I've re-checked my numbers and found that I'd actually messed up base and exponent. Just because 3^5 ist 243, the cube root of 243 is not 5.

Thanks for pointing this out, DJohn!

Thanks for pointing this out, DJohn!