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.)

Short Answer

Expert verified

The least significant decimal digit can be categorized as the rightmost digit of the decimal number written in scientific notation having mod of 10 .

Step by step solution

01

Calculate (1717)17 mod 1

We have to find least significant digit of (1717)17.

For that we need to find out modulo of (1717)17mod10.

Factors of 10 are,1,2,5,10 .

Prime number between the factor of 10 are 2 and 5.10=2,5

Formula we need to use is,

ap-1q-1=1modpq

02

Calculations

Given that,

a=17,p=2 , and q=5.

By putting these value in the formula, we get

172-15-1=1mod10174=mod10

1717can also be written as

1717=42+117

So, 171717mod10can be written as,

174×cmod10×17mod10=7

Where, C is constant.

The least significant decimal digit of 171717 is 7.

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

Prove or disprove: If a has an inverse modulo b, then b has an inverse modulo a.

Suppose that instead of using a compositeN=pqin the RSA cryptosystem (Figure 1.9), we simply use a prime modulus p . As in RSA, we would have an encryption exponent e, and the encryption of a message mmodpwould be memodp.Prove that this new cryptosystem is not secure, by giving an efficient algorithm to decrypt: that is, an algorithm that given and p,e,andmemodp as input, computes . Justify the correctness and analyze the running time of your decryption algorithm.

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.

Compute GCD(210,588)two different ways: by finding the factorization of each number, and by using Euclid’s algorithm.

1.37. The Chinese remainder theorem.
(a) Make a table with three columns. The first column is all numbers from 0 to 14. The second is the residues of these numbers modulo 3; the third column is the residues modulo 5. What do we observe?
(b) Prove that if p and q are distinct primes, then for every pair (j, k) with 0j<qand 0k<q, there is a unique integer 0i<pqsuch thatijmodp andikmodq. (Hint:
Prove that no two different i's in this range can have the same (j, k), and then count.)
(c) In this one-to-one correspondence between integers and pairs, it is easy to go from i to (j, k). Prove that the following formula takes we the other way:
i={j.qq-1modp+kpp-1modq}modpq
(d) Can we generalize parts (b) and (c) to more than two primes?

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