Project Euler Forum

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.

Tristen's problem solved, no need for further reactions.

Dear pysaumont, could you please look for the right place to put your question? I take it that you are talking about posts on the main site projecteuler.net. As long as your post is the last post in a thread you are not allowed to make a new one. The reason is that this prevents people to fill the e...

As far as I know there hasn't been changed anything to the pdf's.
And I would certainly not call them horrible, unformatted and what you were calling them further.
Are you sure you are referring to the same documents?

Many languages have an operator that takes two integers and calculates the bitwise xor of those two integers.
That saves the tedious converting to binary and back.
In many languages that operator is ^. (C and derivatives, Java , Python)
In your case that would be: 72^97 which gives 41.

There's actually no need to have looked up the answer somewhere.
Some people simply try some answers around the value their program gives. Just to rule out off by one answers.

I've looked through the thread and that answers about the ace but i still cant work out why im off by one. Is there any chance i could PM you a list of my results for each pair of hands and you let me know which one is wrong? EDIT: I managed to solve it, no help needed anymore Great. Next time plea...

Yes, but not a question you should try to answer here.
Selecting a single sentence from a longer post is not the way to go.
Please let your grey cells do a little bit of working instead of trolling here.

The problem was that you posted something you thought was a solution. Several people tried to answer your questions. In my opinion you have been served enough. Actually Lilstalker didn't ask you a question. Lilstalker translated the question of the problem to the translation if it he gave you. That ...

No, the overviews are not updated because the source files seem to be lost. To prevent your solution to be lost foreverone of the next days I made your post in the forum permanent. I'm going to remove the spoilers in your post. It happens more often that later on new solutions appear in the forums. ...