Explain Fermat's last theorem by a three-way deadlock-新党あい

I do not know the rules of how to solve mathematics properly, but I will explain Fermat's last theorem.

First, there are three people of X, Y, Z.

They play the game of scissors-paper-rock.

To equilibrate with three people, they must be scissors-paper-rock at the same time.

It is the same for 3 people with 3 choices.

When choices are represented by n + 1, there are 3 people, so n = 2.

But if n is 3, there is another choice besides scissors-paper-rock.

There are one choice that is not chosen among the four choices and three people.

With three people, it is not possible to select all four options and put it in an equilibrium state.

Since n + 1 = 4 is impossible, even if the number increases further, it does not hold.

n + 1 = 3 is n = 2 finished.

Thank you for reading to the end.

Currently, in our blog we have not set up a comment field for reasons such as bot countermeasures.

If you have a Twitter account, I would like to have a comment here.
(If it is within Twitter, it can be any place other than the link destination)
Of course you follow and retweet, Like! Even if only it is welcome.

In addition, various requests are accepted by Twitter.

Currently, I am not affiliated with the company.
I am searching for a new way of doing work.
Because I am in the current situation I have decided to recruit (I think it is doubtful to read by myself).
If you are interested, I would appreciate if you can contact Twitter.
Please do not hesitate to consult about the degree of tackle.
Thank you. <(_ _)> 　　

Explain Fermat's last theorem by a three-way deadlock

Kindleの著書

ウィッシュリスト

直近の記事

論理的整合性を欠いた生成AIの話［ガソリン高騰を税金で補助する違和感など］

このブログを検索

ブログアーカイブ

カスタム人気記事

Translate

SHOPPING

Central banks

amazon

楽天

ranking