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.
Help please!![GCD problem]
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.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en3 | Muhammad_mhs | 2020-05-22 22:28:12 | 1 | Tiny change: 'of integers points on' -> 'of integer points on' | ||
en2 | Muhammad_mhs | 2020-05-22 22:27:23 | 1 | Tiny change: 'gers point on a segm' -> 'gers points on a segm' | ||
en1 | Muhammad_mhs | 2020-05-22 22:26:52 | 256 | Initial revision (published) |