Number Theory Theorems: Understanding Divisibility Rules

Click For Summary

Homework Help Overview

The discussion revolves around theorems related to divisibility in number theory, specifically examining the conditions under which one integer divides a linear combination of others. Participants are exploring two specific statements regarding divisibility: if \( a|b \) and \( a|c \), then \( a|bx + cy \) for any integers \( x \) and \( y \), and if \( a|b \) and \( b|c \), then \( a|bx + cy \) for any integers \( x \) and \( y \).

Discussion Character

  • Conceptual clarification, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants are attempting to prove the theorems using definitions of divisibility and exploring the implications of their variable choices in their proofs. Some are questioning the clarity and correctness of their notation and the use of variables.

Discussion Status

The discussion is active, with participants providing feedback on each other's proofs and clarifying the importance of variable selection. Some guidance has been offered regarding the potential pitfalls of reusing letters in mathematical proofs, which could lead to confusion.

Contextual Notes

Participants are working under the constraints of homework rules, which may limit the resources they can reference. There is an emphasis on understanding the definitions and implications of divisibility without providing complete solutions.

chimath35
Messages
110
Reaction score
0
So could someone please clarify these:

a|b and a|c then a|bx+cy for any x,y integers?

a|b and b|c then a|bx+cy for any x,y integers?

seems the two are very similar, but are those both theorems?
 
Physics news on Phys.org
chimath35 said:
So could someone please clarify these:

a|b and a|c then a|bx+cy for any x,y integers?

a|b and b|c then a|bx+cy for any x,y integers?

seems the two are very similar, but are those both theorems?

Yes, they are both theorems. You should try to prove them using the definition of 'divides'.
 
  • Like
Likes   Reactions: 1 person
al=b
ad=c
ae=bx+cy
we can call bx+cy big E
and here it shows big E equal to a times an integer
ae=alx+ady
ae=a(lx+dy)
 
Last edited:
al=b
bd=c
ae=bx+cy
ae=alx+bdy
ae=alx+aldy
ae=a(lx+ldy)
 
Last edited:
so both of these big E's are integers from the laws of addition and multiplication seeing that all letters here are representing integers
 
chimath35 said:
ac=b
ad=c
ae=bx+cy
we can call bx+cy big E
and here it shows big E equal to a times an integer
a=acx+ady
ae=a(cx+dy)

Sort of. You've got the right idea. But if you are trying to prove a|b and a|c then a|bx+cy for any x,y integers, you are overusing some letters. a|b means pa=b for some integer p and a|c means qa=c for some integer q. No reason to think p=c. Try and present the proofs again without that flaw. It's the same proof really.
 
  • Like
Likes   Reactions: 1 person
Dick said:
Sort of. You've got the right idea. But if you are trying to prove a|b and a|c then a|bx+cy for any x,y integers, you are overusing some letters. a|b means pa=b for some integer p and a|c means qa=c for some integer q. No reason to think p=c. Try and present the proofs again without that flaw. It's the same proof really.

I never said p=c.
 
chimath35 said:
I never said p=c.

Not in so many words, no. But you said given a|b and a|c means ac=b. a|b means a*(something)=b. That something doesn't have to be c. c already has a meaning in the problem. It's just sloppy.
 
  • Like
Likes   Reactions: 1 person
On the second proof I had to use many letters so I could factor out a. It would not have worked otherwise. Show me if there is a simpler way please. I think I had to keep c the same as it is important.
 
  • #10
I mean this proof is correct and complete right?
 
  • #11
chimath35 said:
On the second proof I had to use many letters so I could factor out a. It would not have worked otherwise. Show me if there is a simpler way please. I think I had to keep c the same as it is important.

There are 26 letters you can use. When you want to say a|b means (something)*a=b just use a letter for the (something) that's not already used in the problem. The spirit of your proofs is correct. They could be marked incorrect if you don't do that.
 
  • Like
Likes   Reactions: 1 person
  • #12
Okay thanks please point out where I did that as I tried to be very careful not to use the same letter twice for anything.
 
  • #13
Sorry never mind, I see what you mean. Don't use that c I get it.
 
  • #14
That is suppose to be a common error when learning proofs I see now.
 
  • #15
chimath35 said:
Okay thanks please point out where I did that as I tried to be very careful not to use the same letter twice for anything.

Ok, if you want to prove a|b and a|c then a|bx+cy for any x,y integers, and you want to start by saying that a|b means b=a*(something) don't use a, b, c, x or y for the something. If you do, it's going to confuse someone reading it. I promise.
 
  • Like
Likes   Reactions: 1 person
  • #16
al=b
ad=c
ae=bx+cy
we can call bx+cy big E
and here it shows big E equal to a times an integer
ae=alx+ady
ae=a(lx+dy)
al=b
bd=c
ae=bx+cy
ae=alx+bdy
ae=alx+aldy
ae=a(lx+ldy)
 
  • #17
Well thanks, I now learned even more not to use a letter that will be used at all in the proof.
 
  • #18
chimath35 said:
al=b
ad=c
ae=bx+cy
we can call bx+cy big E
and here it shows big E equal to a times an integer
ae=alx+ady
ae=a(lx+dy)



al=b
bd=c
ae=bx+cy
ae=alx+bdy
ae=alx+aldy
ae=a(lx+ldy)

I would skip the big E thing because I don't know what it means but yes, you've shown bx+cy=a*(lx+dy) in the first case and bx+cy=a*(lx+ldy) in the second. So in both cases a|(cx+dy). You've proved the theorems. Well done.
 
  • Like
Likes   Reactions: 1 person

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
3
Views
2K
Replies
7
Views
3K
Replies
3
Views
2K