Number Theory: Simple Divisibility & GCD

Click For Summary
SUMMARY

The discussion centers on proving that if N=abc+1, then the greatest common divisor (GCD) of N with each of a, b, and c is 1, expressed as (N,a)=(N,b)=(N,c)=1. The proof utilizes a contradiction approach, demonstrating that if a common divisor d greater than 1 exists, it would also divide 1, leading to a contradiction. Additionally, the conversation touches on the validity of the converse of the linear combination theorem, confirming that it is not universally true.

PREREQUISITES
  • Understanding of basic number theory concepts, specifically GCD.
  • Familiarity with proof techniques, including proof by contradiction.
  • Knowledge of linear combinations in number theory.
  • Basic algebraic manipulation skills.
NEXT STEPS
  • Study the properties of GCD and their applications in number theory.
  • Learn about alternative proof techniques, such as direct proof and contrapositive proof.
  • Explore linear combinations and their implications in number theory.
  • Investigate the implications of the Euclidean algorithm on GCD calculations.
USEFUL FOR

This discussion is beneficial for students of number theory, particularly those new to proofs, as well as educators teaching GCD concepts and proof techniques.

doubleaxel195
Messages
46
Reaction score
0

Homework Statement


Prove that if N=abc+1, then (N,a)=(N,b)=(N,c)=1.


Homework Equations





The Attempt at a Solution


Assume N=abc+1. We must prove (N,a)=(N,b)=(N,c)=1. Proceeding by contradiction, suppose (N,a)=(N,b)=(N,c)=d such that [tex]d\not=1[/tex]. Then we know, d | N and d | abc. Thus, from our assumption, we see that d | 1, a contradiction.

Is this a valid argument? Also, what is another way to prove this without using contradiction? Thanks, this is my first class with proofs. Also, I know "if (a,b)=d, then ax+by=d." Is the converse true?
 
Physics news on Phys.org
Yes, this is a valid argument.

And the converse is not true: consider 9.1+7.(-1)=2, but (9,7) is not 2...
 
Thank you very much!
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
20
Views
3K
Replies
1
Views
2K
Replies
12
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
2
Views
1K
  • · Replies 22 ·
Replies
22
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K