Solve the

So you still have to solve #233 (instead of #610) in order to earn the award.**first**twelve Fibonacci numbered problems.- Tue Jun 30, 2020 4:20 pm
- Forum: News, Suggestions, and FAQ
- Topic: Fibonacci Fever Award not earned
- Replies:
**1** - Views:
**543**

The throphy is described in the hover text as:

Solve the **first** twelve Fibonacci numbered problems.

So you still have to solve #233 (instead of #610) in order to earn the award.- Mon Jun 15, 2020 1:45 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 684
- Replies:
**13** - Views:
**5296**

The Fibonacci sequence is given as $f_0=0, f_1=1, f_2=1, f_3=2 \dots$

- Sat Jun 13, 2020 11:04 am
- Forum: Recreational
- Topic: Thank you PE !
- Replies:
**1** - Views:
**727**

Thanks for the kind feedback, Oscar! Solving 100 problems is a great achievement (you are very close to the One Percenter badge) and it is nice that you appreciate the work we have put into designing the problems. We have a strict quality management with triple control for all relevant steps and man...

- Fri May 22, 2020 1:10 am
- Forum: News, Suggestions, and FAQ
- Topic: Feature suggestion
- Replies:
**2** - Views:
**794**

Junglemath, that feature exists:

Just above the first post is a star (with the hover text: Show the best posts); clicking there delivers all post with at least 1 kudo sorted by the number of kudos.

You're wellcome.

Just above the first post is a star (with the hover text: Show the best posts); clicking there delivers all post with at least 1 kudo sorted by the number of kudos.

You're wellcome.

- Fri May 08, 2020 1:34 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 371
- Replies:
**42** - Views:
**19970**

how is "expected to win" defined exactly? the chance of seeing a pair must be >50%? It looks like you are trying to answer a question different from that one asked in the problem text. So analyzing the licence plates adding game you could for example be interested in how many cars Seth must see in ...

- Wed May 06, 2020 8:11 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 059
- Replies:
**114** - Views:
**41055**

As I understand it, each letter was given a number, and that same number is used each time the same letter appears. No, that would have been encryption via substitution and has nothing to do with the described XOR encryption. Now what exactly is a decryption key? If it is supposed to give you the v...

- Fri Mar 06, 2020 2:11 pm
- Forum: News, Suggestions, and FAQ
- Topic: Typo on problem 633 - "signficant"
- Replies:
**2** - Views:
**1477**

Changed - thanks for being our online spelling checker.

- Fri Oct 18, 2019 11:58 am
- Forum: News, Suggestions, and FAQ
- Topic: Some features that are not available on this site
- Replies:
**9** - Views:
**2864**

I am content to stand corrected.Junglemath wrote: ↑Fri Oct 18, 2019 11:13 am Thanks for the reply, but I still maintain that my post wasn't aggressive.

You have chosen Belarus as Location. Any reason for this?Why are you assuming that English isn't my first language?

- Mon Oct 14, 2019 11:05 am
- Forum: News, Suggestions, and FAQ
- Topic: Some features that are not available on this site
- Replies:
**9** - Views:
**2864**

Hi Junglemath I don't know if you are aware that there have been severe attempts to hack Project Euler. A few years ago PE has been shut down for a few months after such an attack, in order to prevent sensitive user data (especially e-mail adresses in combination with password hashes) to be stolen. ...

- Sat Oct 12, 2019 10:12 am
- Forum: News, Suggestions, and FAQ
- Topic: Problem release times
- Replies:
**4** - Views:
**2070**

Is there a specific reason why the release times were moved from Friday/Saturday to Saturday/Sunday? Yes, assuming that the majority of people work from Monday to Friday, releasing problems on Fridays constitues a handycap for participants in America competing for the Eulerian ranks. By the earlies...

- Sun Sep 08, 2019 9:32 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 503
- Replies:
**10** - Views:
**4565**

All of your values F(n) are too big for n>4, for example F(5)=2.05 A brute force program should NOT assume any strategy, but find out which moves turn out to be optimal without preselection. Try to see which cases (trees in the game) for n=5 are omitted by your brute force program. After the brute f...

- Fri Sep 06, 2019 10:30 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 668
- Replies:
**1** - Views:
**1166**

Answered in solution thread. I hope that the answer is sufficient for you.

- Thu Sep 05, 2019 6:30 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 257
- Replies:
**7** - Views:
**4181**

I solved problem 257 using similar technique as the others who solved it. Then I found out missing triplets and rewrote my code completely. Now I can generate all triplets and there are more than twice the number of unique triplets than the answer says. Hi tf08rq0 It seems pretty improbable that yo...

- Fri May 03, 2019 10:40 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 316
- Replies:
**32** - Views:
**17452**

The problem description for 316 appears to have a typo in it. The upper limit of the summation is off to the right of the $\sum$ rather than above it: $\sum \limits_{n = 2}{999999}$. It should read $\sum \limits_{n = 2}^{999999}$ instead. Thanks, changed. (That typo must have sliped in during the l...

- Wed Apr 03, 2019 11:39 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 663
- Replies:
**11** - Views:
**4271**

We've edited the problem text (inserted "contiguous"). Thanks, michelebastione, for mentioning this issue.

- Wed Apr 03, 2019 1:39 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 663
- Replies:
**11** - Views:
**4271**

I am sorry, michelebastione, in this problem we we did NOT use the word subsequence according to the wikipedia's definition, but the way it's described in the definition of $M_n(i)$ (as this would also make the problem quite trivial, since you'd only have to add all positive values of the sequence. ...

- Tue Feb 19, 2019 11:29 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 656
- Replies:
**9** - Views:
**3439**

Vamsi, we are not per se opposed to people building a small, closed group working on solving problems collaboratively.

However, this forum is in no way a closed group and should not be, so we don't want you to use this forum to do so.

However, this forum is in no way a closed group and should not be, so we don't want you to use this forum to do so.

- Mon Feb 18, 2019 7:29 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 656
- Replies:
**9** - Views:
**3439**

This forum is meant for clarifying questions concerning the problem statements. Please adhere the forum rules shown above, especially these: In particular don't post any code fragments or results. Don't start begging others to give partial answers to problems Don't ask for hints how to solve a probl...

- Tue Feb 12, 2019 8:47 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 223 & 224
- Replies:
**22** - Views:
**11729**

You are probably mixing up values in the thread for problem 223 and problem 224.

- Wed Jan 23, 2019 12:15 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 611
- Replies:
**17** - Views:
**5491**

No, I mean three different ways of representing a number as the sum of two squares, then the door with this number would be opened, closed and opened again, thus this number would have to be counted as well.