#n by n design when 2n+1 is prime
try=FastMmLHD(8,8)
try
phi_p(try) #calculate the phi_p of "try".
#n by n design when n+1 is prime
try2=FastMmLHD(12,12)
try2
phi_p(try2) #calculate the phi_p of "try2".
#n by n-1 design when n is prime
try3=FastMmLHD(7,6)
try3
phi_p(try3) #calculate the phi_p of "try3".
#General cases
try4=FastMmLHD(24,8)
try4
phi_p(try4) #calculate the phi_p of "try4".
Run the code above in your browser using DataLab