reserve a,b,c,k,m,n for Nat;
reserve i,j for Integer;
reserve p for Prime;

theorem Th36:
  for n being positive Nat holds 5 * 2|^(2|^n) + 1 is composite
  proof
    let n be positive Nat;
    F(5,n) >= 5*2+1 by Lm16;
    hence F(5,n) >= 2 by XXREAL_0:2;
A1: 5*2|^(2|^n) + 1 <> 3 by Lm16;
    5 = 3*1+2;
    hence thesis by A1,Th34;
  end;
