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

Starting from the definition of xymodN(namely, that Ndivides x-y), justify the substitution rule xx'modN,yy'modNx+yx'+y'modN,and also the corresponding rule for multiplication.

Short Answer

Expert verified

The substitution rule for multiplication can be defined as it is the process of finding out the value of one variable in terms of the second variable and putting the same value to calculate the second variable.

Where, the rule for multiplication is, x×y=x'×y'(modN).

Step by step solution

01

Introduction

The primary distinction between addition reactions and substitution reactions is that the former entail the joining of two or more atoms or functional groups, whilst the latter involve the displacement of an atom or functional group by another functional group.

02

Proof of the substitution rule of addition  

Assume that, xmodN=pandymodN=q.

Then,

x+ymodN=p+q

Now,

p can be written as p=x'modN, since we have x=x'(modN).

In the same way,

qcan be written asq=y'modN , since we have y=y'(modN).

By using the above equations,

(x+y)modN=(x'+y')modN

Therefore,

x+y=x'+y'(modN)

03

Substitution Rule Multiplication Proof

For Multiplication rule we have to prove x*yx'*y'(modN)

Assume that,

xmodN=pymodN=q

By multiplying pandq.

x×y(modN)=a×b

Now,

pcan be written asp=x'modN since we havex=x'(modN) .

In the same way,

qcan be written asq=y'modN since we have y=y'(modN)

By using the above equation,

(x×y)modN=(x'×y')modN

The above expression is,

x×y=x'×y'(modN)

Therefore, the solution isx×y=x'×y'(modN) .

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

The grade-school algorithm for multiplying two n-bit binary numbers x and y consist of addingtogethern copies of r, each appropriately left-shifted. Each copy, when shifted, is at most 2n bits long.
In this problem, we will examine a scheme for adding n binary numbers, each m bits long, using a circuit or a parallel architecture. The main parameter of interest in this question is therefore the depth of the circuit or the longest path from the input to the output of the circuit. This determines the total time taken for computing the function.
To add two m-bit binary numbers naively, we must wait for the carry bit from position i-1before we can figure out the ith bit of the answer. This leads to a circuit of depthΟ(m). However, carry-lookahead circuits (see
wikipedia.comif you want to know more about this) can add inΟ(logn)depth.

  1. Assuming you have carry-lookahead circuits for addition, show how to add n numbers eachm bits long using a circuit of depth Ο(lognlogm).
  2. When adding three m-bit binary numbers x+y+z, there is a trick we can use to parallelize the process. Instead of carrying out the addition completely, we can re-express the result as the sum of just two binary numbersr+s, such that the ith bits of r and s can be computedindependently of the other bits. Show how this can be done. (Hint: One of the numbers represents carry bits.)
  3. Show how to use the trick from the previous part to design a circuit of depthΟ(logn)for multiplying two n-bit numbers.

Show that if a has a multiplicative inverse modulo N, then this inverse is unique (modulo N).

Wilson's theorem says that a numberis prime if and only if
(N-1)!=-1(modN).

(a) If is prime, then we know every number1x<p is invertible modulo . Which of thesenumbers is their own inverse?
(b) By pairing up multiplicative inverses, show thatrole="math" localid="1658725109805" (p-1)!=-1(modp) for prime p.
(c) Show that if N is not prime, then(N-1)!(modN) .(Hint: Considerd=gcd(N,(N-1)!.)
(d) Unlike Fermat's Little Theorem, Wilson's theorem is an if-and-only-if condition for primality. Why can't we immediately base a primality test on this rule?

What is the least significant decimal digit of (1717)17? (Hint: For distinct primesp,q, and any a is not equal to role="math" localid="1658726105638" a0(modpq), we proved the formula role="math" localid="1658726171933" a(p-1)1(modpq)in Section 1.4.2.)

Consider the problem of computing N!=1·2·3···N.

(a) If Nis an role="math" localid="1658397956489" n-bit number, how many bits long is N!, approximately ( inΘ(·)form)?

(b) Give an algorithm to compute N!and analyze its running time.

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