Define by $$$f(l, r)$$$ the number of sets of pairs of relatively prime integers of $$$l, l + 1, \ldots, r$$$, and by $$$g(l, r)$$$ the number of sets of pairs of relatively prime integers of $$$l, l + 1, \ldots, r$$$ such that there is no $$$x$$$ among $$$l + 1, \ldots, r$$$ satisfying Slavko's constraint. Then we have the equality