Обсуждение @ 1349. Ферма @ Timus Online Judge

There are 3 variants deside.

Послано MILAN 20 мар 2005 11:08

[Code deleted]

I have AC, but I can't prove it.

Edited by moderator 02.10.2021 16:15

Ferma's Great Theorem... Few can prove it :) (-)

Послано Dmitry 'Diman_YES' Kovalioff 20 мар 2005 13:39

Re: There are 3 variants deside.

Послано Sergey Baskakov, Raphail and Denis 21 мар 2005 02:58

Well, I got AC either.

And my solution is very similar, the only difference is that I'm using CASE statement (:

But I designed my solution being aware of Fermat's last theorem.

I would be grateful if you could explain, how you managed to figure out the solution without knowing that theorem. Just by considering some sample situations? Or were you aware of that theorem either?

rafailka

Re: There are 3 variants deside.

Послано Maigo Akisame (maigoakisame@yahoo.com.cn) 29 май 2005 12:43

Wouldn't high-precision be fine?

Re: There are 3 variants deside.

Послано FireHeart 19 ноя 2007 21:39

This is "small Fermat theorem"
Fermat told that you have no answer if n>=3

In this problem (0 ≤ n ≤ 100) (+)

Послано Orlangur [KievNU] 20 ноя 2007 16:04

Feel the difference:

http://en.wikipedia.org/wiki/Fermat's_little_theorem
http://en.wikipedia.org/wiki/Fermat's_last_theorem

Re: There are 3 variants deside.

Послано bsu.mmf.team 15 сен 2008 18:10

No, it's a "Great Theorem of Ferma", and he proved it only for n=4. The all theorem was proved by Andrew Wiles (England) in 1994.

Re: Ferma's Great Theorem... Few can prove it :) (-)

Послано Baurzhan 7 ноя 2009 20:04

NOBODY can prove it! Elementary proof doesn't known nowadays, only in 1995 some mathematician found complicated evidence (130 pages) of this theorem.

Edited by author 07.11.2009 20:07

Re: Ferma's Great Theorem... Few can prove it :) (-)

Послано svr 7 ноя 2009 20:45

I think that your are right!
My opinion is to see on "no elementary" proves
as on politic plays of big boys that can't give
anything to algorithms and programming.

Обсуждение задачи 1349. Ферма