Suppose we are given an equation in $ax+(a + 1)y=c$
Now we have to find for how many values of $c$ where $c \in [1,\infty)$ will have no positive integral solution.
I'm new to diophantine equation, so I can't think of any approach. But can it be found mathematically?
Till now my approach is based on programming/brute force
I'm using a small function to check for all possible values.
void bruteforce(int a, int b, int n)
{
for (int i = 0; i * a <= n; i++) {
if ((n - (i * a)) % b == 0) {
if((i)>0 && ((n - (i * a)) / b)>0){
cout << "x = " << i << ", y = " << ;
}
return;
}
}
cout << "Not Possible";
}
But how can i find it more mathematically?
Example -
$3x+4y$ This equation won't have any positive integer solution for $c∈\{1,2,5\}$
$4x+5y$ this equation won't have any positive integer solution for $c ∈ \{1,2,3,6,7,11\}$ so answer would be $6$
So answer comes as $^3C_2$ in first case and $^4C_2$ in second.