Find the largest n so that 2^n divides 72!.
a=1;c=if(72! % (2^a)==0, goto2, goto3);printc, a; a++;if(a<1000, goto1, 0)
The largest n = 70, so that 72! mod 2^70 =0
