Number Theory: Simple Divisibility & GCD

In summary, the conversation discusses how to prove that if N=abc+1, then (N,a)=(N,b)=(N,c)=1. The attempted solution uses proof by contradiction, assuming the opposite and arriving at a contradiction. The validity of this argument is confirmed. Another possible approach to proving this without using contradiction is not mentioned. The conversation also briefly mentions the converse of the statement, stating that it is not always true.
  • #1
doubleaxel195
49
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
  • #2
Yes, this is a valid argument.

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

Related to Number Theory: Simple Divisibility & GCD

1. What is Number Theory?

Number Theory is a branch of mathematics that deals with the properties of integers and their relationships with one another. It is concerned with topics such as divisibility, prime numbers, and factorization.

2. What is Simple Divisibility?

Simple divisibility in Number Theory refers to the ability of one integer to be evenly divided by another integer without leaving a remainder. For example, 10 is divisible by 2 because 10 divided by 2 is equal to 5 with no remainder.

3. What is the Greatest Common Divisor (GCD)?

The Greatest Common Divisor (GCD) is the largest positive integer that divides two or more integers without leaving a remainder. It is also known as the Greatest Common Factor (GCF). For example, the GCD of 12 and 18 is 6, as 6 is the largest positive integer that divides both 12 and 18 without leaving a remainder.

4. How is the GCD calculated?

The GCD can be calculated using the Euclidean algorithm, which involves repeatedly dividing the larger number by the smaller number and using the remainder as the new divisor until the remainder is equal to 0. The last non-zero remainder is the GCD of the original two numbers.

5. What are some practical applications of Number Theory?

Number Theory has many practical applications, including cryptography, coding theory, and computer science. It is also used in fields such as engineering, physics, and economics for problem-solving and optimization. Additionally, many real-world problems can be modeled and solved using Number Theory concepts and techniques.

Similar threads

  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
569
  • Calculus and Beyond Homework Help
Replies
20
Views
2K
  • Calculus and Beyond Homework Help
Replies
12
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
408
  • Calculus and Beyond Homework Help
Replies
3
Views
610
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
24
Views
970
  • Calculus and Beyond Homework Help
Replies
3
Views
575
Back
Top