Project Euler Forum

No.
You can sort the forum (on this board) alphabetically and none of the topics is so dramatically long as you are suggesting.

hk's nemesis :) (Bai Li). I hope it is pure ignorance about Greek mythology that makes you call Luckytoilet 'my nemesis' otherwise I have to consider this remark an unforgivable offense. There is nothing funny about this remark that justifies a smiling face. Please read: https://en.wikipedia.org/wi...

pjt33 wrote: ↑Tue Oct 20, 2020 8:50 am

hk wrote: ↑Wed Feb 15, 2012 8:53 am I fear that explaining in considerable more detail makes an otherwise nice problem almost unreadable.

That post of mine is really a long, long time ago.

Only if you have something new to add that wasn't mentioned in the other posts. Or if you have a program in a language that isn't in the thread already.

jfreiberg wrote: ↑Mon Oct 12, 2020 5:30 pm
I can't think of a clever name to use for 700.

You could have a look at this page:
https://www.georgehart.com/virtual-poly ... fixes.html

You're right.
However, after the correct answer was on the site the number of correct answers grew rather fast.
The difficulty is measured as the speed of solutions not the number of them.

10 weeks after publication a problem is moved from recent problems to the archives.
At that moment a difficulty assessment is automatically calculated.
If there are less than 100 solvers the assessment is temporary.

The answer has been corrected.
Apologies for the inconvenience.

I inserted a return after the code statement and it displays fine now.

The programming language that is shown is the 'preferred programming language' not the actual language used.

if $p\mod 3=1$ there are three solutions, if $p\mod3 =2$ there is one solution to the equation $a^3=1 \mod p$
(See also https://math.stackexchange.com/question ... od-p-for-x)

If you select 'Active members only' (on the statistics start page) active Python members can be displayed.

On the about page (when logged in) it reads: DISCLAIMER The popularity of Project Euler has increased tremendously over the years since its inception through the concerted effort of numerous people. Members have generally taken pride in showing their achievements. The obvious place to do so is the f...

Please don't start a new topic for a problem if there exists one already.

Personally I think the choice mathematicians made is not arbitrary, on the contrary.

Same problem here. (both on Chrome and Edge)
Other pages using Mathjax load perfectly. Even the second page of the forum for Problem 497 (View Problem) loads without delay.
The page hangs in the middle of the post by nhmllr.
Error code: RESULT_CODE_HUNG

In Vietnamese I guess.
Perhaps you should go elsewhere with your question.

It is the number of pebbles taken by the previous player on the immediately preceding turn.

I think you should read my last post in the poll thread.

I don't think it is a good idea to spread the discussion over several threads.
So please go to viewtopic.php?p=58086#p58086

You can find out by trying both options for F(10,10).
Somewhat higher in this thread you can even find smaller cases to verify which of the two options holds.