reserve a,b,c,d,m,x,n,j,k,l for Nat,
  t,u,v,z for Integer,
  f,F for FinSequence of NAT;
reserve p,q,r,s for real number;

theorem
  a,b are_coprime & a + b > 2 & n is odd implies not a+b divides a|^n-b|^n
  proof
    assume
    A1: a,b are_coprime & a + b > 2 & n is odd; then
    consider k such that
    A2: n = 2*k+1 by ABIAN:9;
    a+b divides a|^n+b|^n by A2,NEWTON01:35;
    hence thesis by A1,Th31;
  end;
