Question about problem involving gcd

  • MHB
  • Thread starter issacnewton
  • Start date
  • Tags
    Gcd
In summary, GCD (Greatest Common Divisor) is the largest positive integer that divides into two given numbers without any remainder. It is calculated using the Euclidean algorithm. Gcd is always a positive integer and is used in various mathematical problems, such as simplifying fractions, finding the lowest common multiple, and solving linear equations. The main difference between gcd and lcm (Least Common Multiple) is that gcd is the largest divisor while lcm is the smallest multiple. Gcd can also be greater than the smaller of the two given numbers if the smaller number is a multiple of the larger number.
  • #1
issacnewton
1,041
37
HelloI am studying the problem given in the attachement. In the solution given, it says "Similarly \( d|\gcd(a,-b) \) ". I could not understand why this is so.thanks
 

Attachments

  • 1.png
    1.png
    16.9 KB · Views: 89
Physics news on Phys.org
  • #2
IssacNewton said:
HelloI am studying the problem given in the attachement. In the solution given, it says "Similarly \( d|\gcd(a,-b) \) ". I could not understand why this is so.thanks
$d|\gcd(a,-b)$ follows from the fact that $d=\gcd(a,b)$.
 
  • #3
thanks...I should have realized that...
 

FAQ: Question about problem involving gcd

What is gcd and how is it calculated?

GCD (Greatest Common Divisor) is the largest positive integer that divides into two given numbers without any remainder. It is calculated using the Euclidean algorithm.

Can gcd be negative?

No, gcd is always a positive integer.

How is gcd used in solving mathematical problems?

Gcd is used in various mathematical problems, such as simplifying fractions, finding the lowest common multiple, and solving linear equations.

What is the difference between gcd and lcm?

GCD (Greatest Common Divisor) is the largest positive integer that divides into two given numbers without any remainder, while LCM (Least Common Multiple) is the smallest positive integer that is a multiple of two or more given numbers.

Can gcd be greater than the smaller of the two given numbers?

Yes, gcd can be greater than the smaller number if the smaller number is a multiple of the larger number.

Similar threads

I Understanding the Results of gcd(x,n)
Replies
8
Views
1K
MHB Prove that CnXCm isomorphic to Cgcd(m,n)XClcm(m,n)
Replies
3
Views
2K
MHB Properties of gcd's and relatively prime integers
Replies
2
Views
2K
MHB Does Z[root(-3)] Qualify as a GCD Domain?
Replies
1
Views
2K
MHB How Do GCDs Coincide in Principal Ideals According to Rotman's Proposition 3.41?
Replies
1
Views
1K
MHB GCD of Two Specified Sequences of Numbers: Conditions for Equality
Replies
1
Views
2K
MHB Are GCDs Always Defined in Integral Domains?
Replies
2
Views
2K
MHB GCDs of Polynomials: Reading Rotman's Corollary 3.58
Replies
1
Views
1K
MHB Greatest common divisor of a and b
Replies
8
Views
2K
What Defines a Primitive Pythagorean Triple?
Replies
8
Views
5K

Hot Threads

Recent Insights

Back
Top