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!

## Search found 79 matches

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

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

### 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:
**4709**

### 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:
**4709**

### 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:
**9974**

### 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 9:46 am
- Forum: Recreational
- Topic: Problem 638
- Replies:
**3** - Views:
**7264**

### 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 8:24 am
- Forum: Recreational
- Topic: Problem 638
- Replies:
**3** - Views:
**7264**

### 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 8:07 am
- Forum: Programming languages
- Topic: Swift Arrays
- Replies:
**0** - Views:
**9079**

### 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 7:00 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 637
- Replies:
**3** - Views:
**1346**

### 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?

- Mon Sep 10, 2018 2:02 pm
- Forum: News, Suggestions, and FAQ
- Topic: Project Euler problem proposal rejects.
- Replies:
**4** - Views:
**2711**

### Project Euler problem proposal rejects.

This post is directed at the PE Admins. I made about 5 to 10 problem proposals to Project Euler, none of which got accepted so far, which is fine I guess. Others might have submitted problems too that got rejected. So, I was thinking maybe there might be people out there who are interested in taking...

- Tue Mar 06, 2018 1:00 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 259
- Replies:
**19** - Views:
**7807**

### Re: Problem 259

Thanks for your comment. I will know whether my number is correct or not in a few days when I am done implementing my algorithm. In my expression count, two different expressions could possibly result in the same reachable number, so I would expect my number to be higher. EDIT: The number I came up ...

- Tue Mar 06, 2018 8:37 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 259
- Replies:
**19** - Views:
**7807**

### Re: Problem 259

My problem is that I get the solution but it takes nearly 15 minutes. I took some measurements and I am evaluating 3,392,923,553 expressions, about 3,951,693 per second, which actually seems quite fast. I just don't see how it can be done in 1 minute. An approximate calculation for the number of ex...

- Sat Mar 03, 2018 10:05 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 259
- Replies:
**19** - Views:
**7807**

### Re: Problem 259

Is 123456789 a valid reachable number? I am thinking yes, but, just want to confirm.

Thanks.

Thanks.

- Sun Jan 07, 2018 8:11 am
- Forum: News, Suggestions, and FAQ
- Topic: Summer 2017 Website Update
- Replies:
**87** - Views:
**25766**

### Re: Summer 2017 Website Update

I was away from PE for the last three weeks or so, returned today and noticed all the changes to the website. Thanks euler and the PE development team for making such improvements to the website....

- Tue Nov 14, 2017 2:34 pm
- Forum: Recreational
- Topic: Solving PE problems multiple times.
- Replies:
**7** - Views:
**8757**

### Re: Solving PE problems multiple times.

I was thinking of not just implementing the same algorithm in C++ that was previously implemented in Haskell. I was thinking of potentially coming up with better algorithms to solve the same problems. It is just that this time around I was thinking of using C++ with GMP as the implementation languag...

- Tue Nov 14, 2017 1:34 pm
- Forum: Recreational
- Topic: Solving PE problems multiple times.
- Replies:
**7** - Views:
**8757**

### Re: Solving PE problems multiple times.

I am aware of the Reset Progress button, and I do not wish to use it, as I would lose all of the progress. Ideally, instead of a 'Reset Progress' I would have preferred a new 'Problem Solving History', but I can get the equivalent by creating a new account. My reason for wanting to go back and redo ...

- Tue Nov 14, 2017 12:31 pm
- Forum: Recreational
- Topic: Solving PE problems multiple times.
- Replies:
**7** - Views:
**8757**

### Solving PE problems multiple times.

To start off, I was first introduced to PE by a friend in Spring 2011. I liked solving the problems, so as user 'vamsikal' I solved about 76 problems in Haskell/Scala then and stopped for various reasons. Then again, in Spring of 2014, I started solving PE problems and this time around as 'vamsikal2...

- Wed Sep 27, 2017 10:05 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 375
- Replies:
**8** - Views:
**3114**

### Re: Problem 375

I understand that PE discourages asking for intermediate values, it is just that for this problem I would have liked it if the problem itself gave a few more "interesting" examples that would aid with debugging the algorithm. <snipped by moderator> EDIT: Solved PE 375. The trick is <snipped by moder...

- Wed Sep 27, 2017 8:20 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 375
- Replies:
**8** - Views:
**3114**

### Re: Problem 375

Would it be possible for someone to either post here or PM me the values for M(6500000), M(10000000) and M(20000000). I have code that gives correct answers for M(10) and M(10000), but the code path to compute these values is significantly different from code path that will compute the above request...

- Wed Sep 20, 2017 10:54 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 386
- Replies:
**15** - Views:
**6218**

### Re: Problem 386

I just solved this problem, and, really enjoyed solving it. This problem is like one of the PE problems, where you brute-force for small values, and then observe a pattern and then use that pattern to solve for the parameters of the problem. It is problems like this one that make PE so enjoyable and...