1. A path is a sequence of steps from start point(0, 0) to end point(W, H).

2. A step can be made from point A(a, b) to point B(a + x, b + y) if the distance between A and B is a Fibonacci number. Take a good look at the image in the problem to understand how a step can be made.

## Search found 71 matches

- Mon May 20, 2019 5:06 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 662
- Replies:
**6** - Views:
**3105**

- Sun May 05, 2019 1:35 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 624
- Replies:
**1** - Views:
**4167**

### Re: Problem 624

A little late, but good for you! Hopefully, I should also be able to solve this problem.

EDIT: I can match the example for P(2), but my modular arithmetic skills are not enough to get me across the line on this one!

EDIT: I can match the example for P(2), but my modular arithmetic skills are not enough to get me across the line on this one!

- Sat Apr 13, 2019 12:10 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 663
- Replies:
**11** - Views:
**2006**

### Re: Problem 663

I think so, that is exactly why I have not been able to solve this problem. I was unable to come up with a "dynamic" version of the "maximum sub-array sum" algorithm. :

- Fri Apr 05, 2019 11:35 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 663
- Replies:
**11** - Views:
**2006**

### Re: Problem 663

Just wanted to check, say the array $A_n = [8, -1, 2, 3, -5, 6, -100, 2, 4, 6]$, so would the maximum sub-array sum be $8 + (- 1) + 2 + 3 + (- 5) + 6 = 13$. So if negative values can be "absorbed", we should "absorb" them?

- Sun Feb 24, 2019 6:41 am
- Forum: News, Suggestions, and FAQ
- Topic: Project Euler Problem Solvers.
- Replies:
**0** - Views:
**4533**

### Project Euler Problem Solvers.

Hi All PE Problem Solvers, I have created a "Project Euler Problem Solvers" Google Group. This is group is not for sharing answers, it is for collaboratively solving PE problems. If you are interested, please join: https://groups.google.com/forum/#!forum/project-euler-problem-solvers To join: Please...

- Tue Feb 19, 2019 8:57 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 656
- Replies:
**9** - Views:
**1100**

### Re: Problem 656

Fine then, I will wait until 100 solvers have solved the problem. We had a thread on collaborative problem solving a while ago, I do not recall the thread to place a link here. If the admins/moderators are against solvers collaborating on this forum, maybe you need to add another section where peopl...

- Tue Feb 19, 2019 4:17 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 656
- Replies:
**9** - Views:
**1100**

### Re: Problem 656

Instead of posting the partial result on the forum, I probably should have asked someone to verify via PM.

Can I PM someone to verify my result for the 21st term in the sequence given in the example for square_root(31)?

Thanks,

Vamsi

Can I PM someone to verify my result for the 21st term in the sequence given in the example for square_root(31)?

Thanks,

Vamsi

- Mon Feb 18, 2019 2:40 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 656
- Replies:
**9** - Views:
**1100**

### Problem 656

Can someone verify that the 21st value of n which gives a palindromic sub-sequence for alpha = square_root(31) is <removed by moderator> ? The value is too large, otherwise I would have tried to brute-force it somehow. EDIT: I was actually able to brute-force the 21st value of n for which we have a ...

- Tue Dec 04, 2018 4:36 am
- Forum: Recreational
- Topic: Solving PE problems multiple times.
- Replies:
**7** - Views:
**6581**

### Re: Solving PE problems multiple times.

I created another account and solved 103 of the least difficult PE problems as best as I can in the following languages: Rust, Scala, Kotlin, C#, Swift, C++17. It was a lot of fun. While making my third iteration through PE, I learnt sieving methods and deterministic Miller-rabin the hard way. This ...

- Tue Dec 04, 2018 12:48 am
- Forum: Recreational
- Topic: Suggest me a book
- Replies:
**13** - Views:
**8867**

### Re: Suggest me a book

I have looked at a few of the Elementary Number Theory books available at LibGen. For some like me, just starting out on Number Theory, Burton's 7th edition is a great introduction. I have worked through the first two chapters. I would definitely recommend it to any PE enthusiast. It would have been...

- Sun Nov 25, 2018 1:06 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 245
- Replies:
**16** - Views:
**5457**

### Re: Problem 245

I get the same number both with my naive brute-force and a segmented-sieve brute-force.

- Tue Nov 20, 2018 5:50 am
- Forum: Resources
- Topic: My blog about my PE journey.
- Replies:
**0** - Views:
**10068**

### My blog about my PE journey.

I am blogging my experiences in solving PE problems here: https://projecteulerjourney.home.blog/. If you are interested, please visit the blog and leave a comment or two.

Thanks!

Thanks!

- Sun Nov 18, 2018 9:35 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 643
- Replies:
**8** - Views:
**2854**

### Re: Problem 643

There is a minor typo in the problem:

For example, 24 and 40

The correct text is: For example, 24 and 40

For example, 24 and 40

**and**2-friendly because ....The correct text is: For example, 24 and 40

**are**2-friendly because ....- Tue Nov 13, 2018 9:50 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 521
- Replies:
**9** - Views:
**3739**

### Re: Problem 521

Thanks for verifying the result. philiplu, are you <snipped by moderator>? This blog was helpful in solving PE problems.

- Tue Nov 13, 2018 3:57 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 521
- Replies:
**9** - Views:
**3739**

### Re: Problem 521

Can someone verify the answer for n = 201820182018 is <snipped by modrator>? Thanks!

- Sun Nov 04, 2018 4:25 am
- Forum: Resources
- Topic: Ressources and courses for solving project euler problems
- Replies:
**4** - Views:
**7977**

### Re: Ressources and courses for solving project euler problems

I started solving PE problems about 2 and 1/2 years ago. I am also a programmer, not a mathematician, so I could with my current math skills solve about 365 problems. I feel like I have max'd out and any left over problems are beyond my current skill. So I started looking for ways to improve my skil...

- Tue Oct 09, 2018 8:46 am
- Forum: Recreational
- Topic: Problem 638
- Replies:
**3** - Views:
**5616**

### Re: Problem 638

Sorry for posting a spoiler, <snipped by moderator>.

EDIT: Actually, hk you are correct, just <snipped by moderator> gave many meaningful results.

EDIT: Actually, hk you are correct, just <snipped by moderator> gave many meaningful results.

- Tue Oct 09, 2018 7:24 am
- Forum: Recreational
- Topic: Problem 638
- Replies:
**3** - Views:
**5616**

### Problem 638

I hope this is not a spoiler, but has anyone solved PE 638 without using <snipped by moderator>? I would be very interested in knowing if there are any alternate solution methods for this problem. My point being, if you have no clue what <snipped by moderator> are, how would you even know to look fo...

- Sun Sep 30, 2018 7:07 am
- Forum: Programming languages
- Topic: Swift Arrays
- Replies:
**0** - Views:
**6976**

### Swift Arrays

I am a little bit of a programming languages enthusiast. I try to solve PE problems (same problems multiple times) in different languages to get a feel for the languages. I have used Haskell, C++, Java, Scala, Kotlin, Rust to solve PE problems. My personal experience is that Kotlin and Rust stand ou...

- Sun Sep 23, 2018 6:00 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 637
- Replies:
**3** - Views:
**928**

### Problem 637

Just want to check my understanding of the problem. Given n = 99999 (base 10), then (assuming this is the shortest path)

99999 (base 10) -> (9 + 9 + 9 + 9 + 9) (base 10) = 45 (base 10) -> (4 + 5) (base 10) = 9 (base 10).

So, f(99999, 10) = 2. Am I correct?

99999 (base 10) -> (9 + 9 + 9 + 9 + 9) (base 10) = 45 (base 10) -> (4 + 5) (base 10) = 9 (base 10).

So, f(99999, 10) = 2. Am I correct?