Divisibility of c by a and b but not ab .

  • Context: Undergrad 
  • Thread starter Thread starter wubie
  • Start date Start date
  • Tags Tags
    Divisibility
Click For Summary

Discussion Overview

The discussion revolves around the divisibility of a positive integer "c" by two other integers "a" and "b," while exploring the conditions under which "ab" does not divide "c." Participants are addressing specific examples, theoretical implications, and conditions related to divisibility.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant requests examples of integers "a," "b," and "c" such that a|c and b|c but ab does not divide c, noting difficulty in finding such integers.
  • Another participant suggests examples, including a=6, b=4, and c=12, and explains that the common factor between a and b affects the divisibility of ab with respect to c.
  • It is noted that the greatest common divisor (gcd) plays a role in understanding the relationship between a, b, and c, although the exact implications are not fully articulated by all participants.
  • A later post introduces a mathematical expression involving variables X and Y to explore the relationship between the number of factors in the context of divisibility, but the clarity of this argument is uncertain.

Areas of Agreement / Disagreement

Participants express differing levels of understanding regarding the conditions that guarantee ab|c when a|c and b|c. There is no consensus on the necessity of the gcd or the role of prime factors in this context.

Contextual Notes

Some participants mention the importance of common factors and the gcd, but the discussion lacks a clear resolution on how these concepts definitively relate to the divisibility conditions posed in the original question.

Who May Find This Useful

This discussion may be of interest to those studying number theory, particularly in the context of divisibility and the properties of integers.

wubie
Divisibility of "c" by "a "and "b" but not "ab".

Hello,

I am having trouble with this question:

i) Give an example of three positive integers a,b,c such that a|c and b|c but ab does NOT divide c.

ii) In the situation of part (i), is there a condition that guarentees that if a|c and b|c, then ab|c?

iii) Is the condition in part (ii) necessary? Either prove that it is necessary, or give an example to show that it is not necessary.


It took me a long time to find three integers that satisfied conditions in part i) of the question. In fact, I couldn't find any such integers, someone had to tell me.

The integers that were given to me were 2,4,12. Now that these integers were given to me, I definitely can see how they satisfy conditions in part i).

However I still am having trouble with (ii) and obviously (iii).

For part i) I was playing around with prime numbers. And I couldn't find any integers which satisfied part i). Was that my mistake? Was that the reason I couldn't find the integers necessary to answer part i)?

As well, is that the key to ii) and iii)? That is, to guarantee that, if a|c and b|c, then ab|c, a and b must be prime numbers?

Any help would be appreciated. Thankyou.
 
Physics news on Phys.org
i) Give an example of three positive integers a,b,c such that a|c and b|c but ab does NOT divide c.

Did you give this much thought? If a divides c, then c contains all prime factors of a. If b divides c, then c contains all prime factors of b. Doesn't it follow that c contains all prime factors of BOTH a and b and so ab must divide c?
No, it doesn't follow! Why not? What can you say about those prime factors?

Try a= 6, b= 4, and c= 12. WHY doesn't ab divide c?

a= 2, b= 4 and c= 12 also work as you noted. That's because a and b have a FACTOR IN COMMON (in both examples, the common factor is 2). That factor is in c but in ab, we get the factors TOGETHER: i.e. In the first example a= 2*3, b= 2*2, c= 2*2*3 but ab= 2*2*2*3- too many twos. How can you guarantee that that won't happen?
 
Hello HallsofIvy,

I did give this question quite a bit of thought. Suffice it to say that I spent too much time on this last question. I just cannot see how it all fits together. I know NOW that the gcd has something to do with it. But I don't see how.
 
Think of this:
if X=a*b*b
Y=b*c

then XY=(a*b*b)*b*c

then X divides abbc
Y divides abbc

look at XY -> how many b's

how many b's in abbc

does XY divide abbc

will XY divide abbbc? why? how many b's

Aaron
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 33 ·
2
Replies
33
Views
4K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
7
Views
2K
  • · Replies 25 ·
Replies
25
Views
2K