## Search found 79 matches

- Tue Apr 28, 2020 4:04 pm
- Forum: News, Suggestions, and FAQ
- Topic: Removing incentive for spoilers
- Replies:
**14** - Views:
**2950**

### Re: Removing incentive for spoilers

Thanks everyone for all the feedback! As of now, I am taking a break from solving PE problems. The PE problems I have solved and their solutions are still reasonably fresh in my mind. Maybe after a long while, when the problems and their solutions are forgotten, I could try a private-account + open-...

- Tue Apr 28, 2020 2:05 pm
- Forum: News, Suggestions, and FAQ
- Topic: Removing incentive for spoilers
- Replies:
**14** - Views:
**2950**

### Re: Removing incentive for spoilers

DJohn: With real-world problems, you don't know the solution. You don't know if there is a solution. There's no book that will tell you how to do it. If there was, you wouldn't know where it is anyway. And yet you still have this problem, and must solve it. Finding something without knowing what you...

- Tue Apr 28, 2020 9:16 am
- Forum: News, Suggestions, and FAQ
- Topic: Removing incentive for spoilers
- Replies:
**14** - Views:
**2950**

### Re: Removing incentive for spoilers

It is not meant for you to solve all the problems nor is it meant that you have the required knowledge. This is where I strongly disagree. How many PE solvers are capable of achieving the "Perfection" badge? Does this mean that quite a large fraction of PE solvers are going to be locked out of some...

- Tue Apr 28, 2020 7:32 am
- Forum: News, Suggestions, and FAQ
- Topic: Removing incentive for spoilers
- Replies:
**14** - Views:
**2950**

### Re: Removing incentive for spoilers

I was thinking, what if someone tried the following approach to solving PE problems? 1. Create a new PE account. Make it private. (Do not want to mess up the PE statistics.) 2. Pick a PE problem. (Preferably in problem number ascending order.) Try to solve it in a day or a few days. If you can solve...

- Mon Mar 09, 2020 2:02 pm
- Forum: News, Suggestions, and FAQ
- Topic: Removing incentive for spoilers
- Replies:
**14** - Views:
**2950**

### Re: Removing incentive for spoilers

Project Euler Team: I have given some thought as to why I became a member of Project Euler and what my experience with PE was, and, what I think PE should be to have been so as to help me become better at both Mathematics and Computer Programming. The following suggestion may sound ridiculous to you...

- Sat Feb 22, 2020 9:17 am
- Forum: News, Suggestions, and FAQ
- Topic: Removing incentive for spoilers
- Replies:
**14** - Views:
**2950**

### Re: Removing incentive for spoilers

I think you've addressed your own suggestion. There is no need for us to internally implement any system that allows members to unlock the discussion threads without first solving the problem because those sources already exist externally. Agreed that the tools to unlock a PE solution thread are al...

- Sat Feb 22, 2020 4:04 am
- Forum: News, Suggestions, and FAQ
- Topic: Removing incentive for spoilers
- Replies:
**14** - Views:
**2950**

### Removing incentive for spoilers

The Project Euler Team quite understandably does not appreciate spoilers. It is not a complete secret that there are web-pages out there with spoilers to almost every PE problem. So I was thinking the Project Euler Team, instead of policing the internet for spoilers and locking accounts of such user...

- Wed Feb 19, 2020 4:43 am
- Forum: News, Suggestions, and FAQ
- Topic: easier new problems?
- Replies:
**5** - Views:
**1293**

### Re: easier new problems?

Get Elementary Number Theory 7th Edition by David Burton and work through the book. It will greatly help you in becoming better at Project Euler problems. I worked through the first seven chapters of that book and that helped me quite a bit. You could also try to solve easy problems on other website...

- Mon Nov 18, 2019 6:07 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 688
- Replies:
**8** - Views:
**1619**

### Re: Problem 688

Minor clarification: The problem text reads: It is impossible to divide 10 into 5 non-empty piles and hence f(10,5)=0. It is possible to divide 10 into 5 non-empty piles, 10 = 2 + 2 + 2 + 2 + 2. It is impossible to divide 10 into 5 non-empty piles with different number of plates. Should we clarify t...

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

### Re: Problem 662

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.

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.

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

### 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 1:10 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 663
- Replies:
**11** - Views:
**3250**

### 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 12:35 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 663
- Replies:
**11** - Views:
**3250**

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

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

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

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

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

### 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:
**14** - Views:
**12706**

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

### Re: Problem 245

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