Hello everybody)
help me with problem
we looking for quantity of integer solutions (x,y) equation ; |a|,|b| <=
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
I found this:
a.y + b.x = x.y
b.x = y.(x-a)
y=(b.x) / (x-a);
x,y are integers so (a|b means b%a=0)
x-a| b.x
x-a| b.x — b.(x-a)
x-a| b.x — b.x + a.b
x-a| a.b
for every z (z|a.b) there is an integer pair (x,y) suitable to all conditions. So the answer is same with quantity of divisors of a.b