ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1349. Farm

There are 3 variants deside.
Posted by MILAN 20 Mar 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 :) (-)
Posted by Dmitry 'Diman_YES' Kovalioff 20 Mar 2005 13:39
Re: There are 3 variants deside.
Posted by Sergey Baskakov, Raphail and Denis 21 Mar 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.
Posted by Maigo Akisame (maigoakisame@yahoo.com.cn) 29 May 2005 12:43
Wouldn't high-precision be fine?
Re: There are 3 variants deside.
Posted by FireHeart 19 Nov 2007 21:39
This is "small Fermat theorem"
Fermat told that you have no answer if n>=3
In this problem (0 ≤ n ≤ 100) (+)
Posted by Orlangur [KievNU] 20 Nov 2007 16:04
Re: There are 3 variants deside.
Posted by bsu.mmf.team 15 Sep 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 :) (-)
Posted by Baurzhan 7 Nov 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 :) (-)
Posted by svr 7 Nov 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.