   Chapter 8.4, Problem 34ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# Give a counterexample to show that the statement of exercise 33 is false if the hypothesis that gcd(a,b)=1 removed.

To determine

To find:

A counter example of the result “prove that for all integers a,b and c, if gcd(a,b)=1 and a|c and b|c then ab|c ”.

Explanation

Given information:

a,b,c are integers

gcd(a,b)=1

Concept used:

gcd:Greatest common divisor

Calculation:

The objective is to give a counter example of the result “prove that for all integers a,b and c, if gcd(a,b)=1 and a|c and b|c then ab|c ”.

Counterexample.

Let a=2, b=4 and c=16

Then, a|c becomes ac=216 since 16=2×8.

Similarly, b|c becomes bc=416 since 16=4×4

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 