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

Show that if \(a|b{\rm{ and b|a}}\), where a and b are integers, then \(a = b{\rm{ or a = - b}}\)

Short Answer

Expert verified

\(a = b\)or \(a = - b\).

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

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

01

Step 1

DEFINITIONS

a divides b if there exists an integer c such that \(b = ac\)

Notation: \(a|b\).

02

Step 2

SOLUTION

Given: a and b are integers with \(a|b\) and \(b|a\)

To proof: \(a = b\)or \(a = - b\)

PROOF

Since \(a|b\), there exists an integer c such that:

\(b = ac\)

Since \(b|a\), there exists an integer d such that:

\(a = bd\)

Combining these two equations, we then obtain:

\(a = bd = (ac)d = a(cd)\)

By the identity property of multiplication, cd then has to be equal to \({\rm{1}}\).

\(cd = 1\)

Since c and d are both integers whose product is \(1\), c and d are either both \(1\) or both \( - 1\).

\(c = d = 1{\rm{ or c = d = - 1}}\)

Let us use the values for d on the equation \(a = bd\)

\(a = bd = b1 = b\)

\(a = bd = b( - 1) = - b\)

Thus we have then shown \(a = b\)or \(a = - b\).

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

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