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

If nZand n0, prove that n can be written uniquely in the form n=2km, where k0 and m is odd.

Short Answer

Expert verified

It is proved that ncan be written uniquely in the form n=2km, where k0and m is odd.

, where is odd.

Step by step solution

01

Define  n

Assume that 2n, thenn=20n . Here, nis odd.

When 2n , then by Fundamental theorem of Arithmetic

n=2r1p2r2p3r3.........pkrk=2km

Here, k=r1 and p2r2p3r3......pkrk=m.

Remember that 2p2r2p3r3.......pkrk ; therefore it is odd.

02

Unique representation 

Let’s assume that

n=2k1m1=2k2m2with k2>k1

This givesm1=2k2-k1m2

Here, the above equation shows that 2m1and m1is odd.

Hence, k1=k2 can also be written as m1=m2. Hence it is proved.

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 Euclidean Algorithm is an efficient way to find a,b for any positive integers a and b. It only requires you to apply the Division Algorithm several times until you reach the gcd, as illustrated here for 524,148.

(a) Verify that the following statements are correct.

524=148·3+180080<148148=80·1+68068<8080=68·3+12012<6868=12·5+808<1212=8·1+404<88=4·2+0

[The divisor in each line becomes the next line, and the remainder in each line becomes in the next line.]

[As shown in part (b), the last nonzero remainder, namely 4, is the gcd (a,b).

(b) Use part (a) and Exercises 13 and Example 4 to prove that

524,148=148,80=80,68=68,12=12,8=8,4=4,0=4

Use the Euclidean Algorithm to find

(c)1003,456

(d) 322,148

(e) (5858,1436)

The equations in part (a) can be used to express the gcd 4 as a linear combination of 524 and 148 as follows. First, rearrange the first 5 equations in part (a), as shown below.

localid="1645873482628" 80=524-148·3(1)68=148-80(2)12=80-68·3(3)8=68-12·5(4)4=12-8(5)

(f) Equation (1) expresses 80 as a linear combination of 524 and 148. Use this fact and Equation (2) to write 68 as a linear combination of 524 and 148.

(g) Use Equation (1), part (f), and Equation (3) to write 12 as a linear combination of 524 and 148.

(h) Use parts (f) and (g) to write 8 as a linear combination of 524 and 148.

(i) Use parts(g) and (h) to write the gcd 4 as a linear combination of 524 and 148, as desired.

(j) Use the method described in parts (t)-(i) to express the gcd in part (c) as a linear combination of 1003 and 456.

Prove that a positive integer is divisible by 9 if and only if the sum of its digits is divisible by 9. [See Exercise 28]

If a,b=d, prove that role="math" localid="1645880095339" ad,bd=1. [Hint: a=drand b=dsfor some integers rands (Why?). So rand sand you must prove that r,s=1. Apply Theorem 1.2 to a,band divide the resulting equation by d.]

If a,0=1, what cana possible be?

Prove that a positive integer is divisible by 3 if and only if the sum of its digits is divisible by 3.

See all solutions

Recommended explanations on Math 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