There is this well-known elementary theorem:
Every pair of integers $a$ and $b$ has a common divisor $d$ of the form $d=ax+by$. Moreover, every common divisor of $a$ and $b$ divides this $d$.
So, the greatest common divisor can be represented linearly as a function of $a$ and $b$.
But, it seems to me that also an interesting question is when the greatest common divisor can be represented in the following way $ax+by +\alpha xy$, where $\alpha \in \mathbb Z$ is some constant.
It seems obvious that for some $\alpha$ the greatest common divisor $d$ will not be expressible in the form $ax+by +\alpha xy$ but for some other $\alpha$ it will be expressible.
At least, $d$ is expressible as $ax+by +\alpha xy$ if $\alpha=0$ but surely for some $a,b \in \mathbb Z$ the choice $\alpha=0$ is not the only one.
So suppose that for $(a,b) \in \mathbb Z \times \mathbb Z$ the set $\beta ((a,b))$ is the set of all $\alpha$ such that $d=ax+by +\alpha xy$, so, for example, if for some $(a,b)$ we have that there are $(x_r,y_r)$ such that $d=ax_r+by_r+\alpha_r x_r y_r$ for $r=1,...,$ then $\alpha_r \in \beta((a,b))$.
If $\text{noe}(\beta((a,b)))$ denotes the number of elements of the set $\beta ((a,b))$ then I would like to know at least some facts about the function $(a,b) \to \text{noe}(\beta((a,b)))$ and what is generally known about that function, for example, some properties of it or some rules governing its behaviour?