Sage: http://www.sagemath.org/

Simple sage commands are:

You may as well choose Matlab.

8. **Using sage or any other software package, do the following computation (a) Using the sieving method, test whether f(x) 6 (b) If it is primitive, using f(x) to generate the log table GF(26), and give a generator (c) For a = 010100 and b = 000110 (we assume that a = 010100 14 + 12 and the (d) Compute the order of b, given in (c). Show that b a7 1 is irreducible. If so, test whether it is primitive. of GF(26). similar rule to b), compute a b, a2 and b32 (Hint. Use Binomial Forula) 8. **Using sage or any other software package, do the following computation (a) Using the sieving method, test whether f(x) 6 (b) If it is primitive, using f(x) to generate the log table GF(26), and give a generator (c) For a = 010100 and b = 000110 (we assume that a = 010100 14 + 12 and the (d) Compute the order of b, given in (c). Show that b a7 1 is irreducible. If so, test whether it is primitive. of GF(26). similar rule to b), compute a b, a2 and b32 (Hint. Use Binomial Forula)