reserve a, b, n for Nat,
  r for Real,
  f for FinSequence of REAL;
reserve p for Prime;

theorem
  1 < n implies n |-count n = 1
proof
  assume
A1: 1 < n;
A2: now
    assume n |^ (1+1) divides n;
    then n |^ 2 <= n by A1,NAT_D:7;
    hence contradiction by A1,PREPOWER:13;
  end;
  n |^ 1 divides n;
  hence thesis by A1,A2,Def7;
end;
