10.7 Computer Problems

  1. Let p=53047. Verify that L3(8576)=1234.

  2. Let p=31. Evaluate L3(24).

  3. Let p=3989. Then 2 is a primitive root mod p.

    1. Show that L2(3925)=2000 and L2(1046)=3000.

    2. Compute L2(39251046). (Note: The answer should be less than 3988.)

  4. Let p=1201.

    1. Show that 111200/q 1 (mod 1201)forq=2, 3, 5.

    2. Use method of Exercise 54 in Chapter 3 plus the result of part (a) to show that 11 is a primitive root mod 1201.

    3. Use the Pohlig-Hellman algorithm to find L11(2).

    4. Use the Baby Step, Giant Step method to find L11(2).

..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.144.254.231