Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

1.36. Square roots. In this problem, we'll see that it is easy to compute square roots modulo a prime pwith p3(mod4).
(a) Suppose p3(mod4). Show that(p+1)/4 is an integer.
(b) We say x is a square root of a modulo p if a=x2(modp). Show that if p3(mod4)and if a has a square root modulo p, thena(p+1)/4 is such a square root.

Short Answer

Expert verified
  1. p+14is showed as integer.
  2. It is proved that, if p3mod4and if a has a square root modulo p, then ap+14is such a square root is depicted.

Step by step solution

01

Step 1: Introduction to the Concept

After one number is divided by another, the modulo operation yields the remainder or signed remainder of the division (called the modulus of the operation).

02

Step 2: Solution Explanation

a)

The following is a representation of the provided equation "p3mod4"

p=3+4k--------1

  • Because "x1modN" is the same as "x=1+kN"
  • It's worth noting that "k" is an integer.

On both sides of the equation (1), add "1".

p+1=4k+3+1p+1=4k+4p+1=4k+1p+14=k+1--------2

"k+1" is also an integer because "k" is an integer. (k+1) equalsp+14 according to equation (2).

As a result,p+14 is an integer.

03

Step 3: Solution Explanation

b)

From Fermat's "Little Theorem",

ap-1=1modp------3

The following equation has been derived based on equation (3):

ap-1=1modpap-1-1=0modp

Multiply "12" by both sides of the above expression's power values.

ap-12-112=0modpap-12-1=0modpap-12-1ap-12+1=0modp

Moving the negative set of valueap-12-1 to the right side of the equation is not a valid solution.

ap-12+1=0ap-12+1modpap-12+1=0modpap-12=-1modp

Thus, the above equation will not satisfy the Fermat's "Little Theorem".

Moving the positive set of value ap-12+1to the right side of the equation as follows,

ap-12-1=0ap-12+1modpap-12-1=0modpap+12-a=0modpap+12=amodp

The equation above demonstrates this ap+12=amodp, and it may be written as follows:

ap+142=amodp.

When you move the square from left to right, it is converted to square root.

ap+14=amodp

When "a" has a square root modulo “ap+14”is a square root.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Justify the correctness of the recursive division algorithm given in page 25, and show that it takes time O(n2)onn- bit inputs.

If p is prime, how many elements of{0,1,...pn-1} have an inverse modulopn ?

Calculate 2125mod127using any method you choose. (Hint: 127 is prime.)

Give an efficient algorithm to compute the least common multiple of two n-bit numbers x and y, that is, the smallest number divisible by bothx and y. What is the running time of your algorithm as a function of n?

1.38. To see if a number, say 562437487, is divisible by 3, you just add up the digits of its decimalrepresentation, and see if the result is divisible by role="math" localid="1658402816137" 3.

( 5+6+2+4+3+7+4+8+7=46, so it is not divisible by 3).

To see if the same number is divisible by 11, you can do this: subdivide the number into pairs ofdigits, from the right-hand end(87,74,43,62,5) , add these numbers and see if the sum is divisible by11 (if it's too big, repeat).

How about 37? To see if the number is divisible by 37, subdivide it into triples from the end(487,437,562) add these up, and see if the sum is divisible by37 .


This is true for any prime pother than2 and 5. That is, for any prime p≠2,5, there is an integer rsuch that in order to see ifp divides a decimal number n, we breakn into r-tuples of decimal digits (starting from the right-hand end), add up these r-tuples, and check if the sum is divisible by p.

(a) What is the smallest rsuch for p=13? Forp=13 ?

(b) Show thatr is a divisor of p-1.

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free