Help please!![GCD problem]

Revision en3, by Muhammad_mhs, 2020-05-22 22:28:12

In this problem the number of integer points on a segment is gcd(x,y)+1. where x = abs(x1-x2) and y = abs(y1-y2). But why it does? Anyone please explain it. Thanks in advance.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English Muhammad_mhs 2020-05-22 22:28:12 1 Tiny change: 'of integers points on' -> 'of integer points on'
en2 English Muhammad_mhs 2020-05-22 22:27:23 1 Tiny change: 'gers point on a segm' -> 'gers points on a segm'
en1 English Muhammad_mhs 2020-05-22 22:26:52 256 Initial revision (published)