## Search found 11 matches

- Sat Feb 24, 2018 11:50 pm
- Forum: News, Suggestions, and FAQ
- Topic: Posting Spoilers and Collapse Tags
- Replies:
**2** - Views:
**1223**

- Sat Feb 24, 2018 10:27 pm
- Forum: News, Suggestions, and FAQ
- Topic: Posting Spoilers and Collapse Tags
- Replies:
**2** - Views:
**1223**

### Posting Spoilers and Collapse Tags

I have a suggestion: adding collapse tags to projecteuler.chat, because apparently they aren't a thing right now.

Also, is it OK to post spoilers as long as you hide them with hide tags or collapse tags (when they get added if they get added)?

Also, is it OK to post spoilers as long as you hide them with hide tags or collapse tags (when they get added if they get added)?

- Sat Feb 24, 2018 1:48 am
- Forum: Discrete Mathematics
- Topic: Discrete Math Problem
- Replies:
**4** - Views:
**7871**

### Re: Discrete Math Problem

Proof: It can be seen that $x^2+2x+1$ is even, as given in the problem. Therefore, $x^2+2x$ is odd, since an even number minus $1$ is odd. Then, we know that any integer multiplied by $2$ will be even, and an odd number minus an even number will be odd. Therefore, $x^2$ is odd. Since squares of odd ...

- Sun Feb 18, 2018 11:20 pm
- Forum: News, Suggestions, and FAQ
- Topic: Errors/Warnings/Bugs
- Replies:
**529** - Views:
**114541**

### Uhhhhhhhhhhh........

So there is this Project Euler user named Jeetsagar, who has solved 54 problems, all of them 5 percenters. So, I scroll down to the posts' section, and there is a permanent post for problem 349. What's funny, is that the user hadn't solved problem 349 yet. What is going on with that user? Is it beca...

- Sun Feb 18, 2018 9:05 pm
- Forum: News, Suggestions, and FAQ
- Topic: How to get a permanent post?
- Replies:
**4** - Views:
**1998**

### Re: How to get a permanent post?

FYI I know two posts that have 4 or more kudos that aren't permanent. One is on problem 116, and the other is on the pandigital multiples one. There may be many more, so you might want to check for some. P.S. the posts I mentioned are soon to be deleted.

- Sun Jan 28, 2018 1:22 am
- Forum: News, Suggestions, and FAQ
- Topic: Errors/Warnings/Bugs
- Replies:
**529** - Views:
**114541**

- Sat Jan 27, 2018 4:59 am
- Forum: News, Suggestions, and FAQ
- Topic: Errors/Warnings/Bugs
- Replies:
**529** - Views:
**114541**

### Re: Errors/Warnings/Bugs

So, I was just reporting a post when I saw a typo in the reports section: Once you have carefully reviewed the post below, and only if you are certain that you wish to proceed with reporting it as an inppropriate post, please enter the confirmation code and click the Confirm button to complete the p...

- Tue Aug 08, 2017 12:21 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 504
- Replies:
**12** - Views:
**4233**

### Re: Problem 504

I had the same question . Maybe the admins could edit the problem and define what "strictly contains" means on the problem?

- Thu Jul 20, 2017 7:09 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 571
- Replies:
**10** - Views:
**2713**

### Problem 571

A n-super-pandigital number is a number that is simultaneously pandigital in all bases from 2 to n inclusively. However, I don't know if a number can be a pandigital in base i if it has a leading zero. Can a number in base i have a leading zero? EDIT: I'm thinking that leading zeroes aren't allowed....

- Fri Jul 14, 2017 10:34 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 493
- Replies:
**5** - Views:
**2732**

### Re: Problem 493

LOL. Now I see why I got #493 wrong. Thanks for the tips.

- Fri Jul 14, 2017 10:13 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 585
- Replies:
**4** - Views:
**1751**

### Re: Problem 585

I am attempting to verify a conjecture via brute-force to help me solve this problem, I have no alternate ways of verifying this yet. So, can someone confirm that F(2000) = [ number removed ] There is no number there (because it has been censored), so I can't really help you, but I would suggest to...