A question about neighboring fractions.

As @Peter noticed, (b) is a typo and should be $\frac{a+c}{b+d}$. To show that the original isn’t correct, you would just need to find a counter example. One such example is $a=1$, $b=2$, $c=3$, and $d=5$. Then $\frac{a}{b}=\frac{1}{2}$ and $\frac{c}{d}=\frac{3}{5}$ are neighbor fractions, since $ad-bc=-1$, but $\frac{a+b}{c+d}=\frac{3}{8}$ is not between the original fractions (it’s less than both) and is not a neighbor fraction to either of the original fractions (the specified differences are 2 and 9).

The take-away message for you is: if you are having trouble proving what seems to be a simple statement (especially if it doesn’t seem right to you), try out a few examples to see if you can see what is happening and why it’s true. In this case, you likely would have found a counter example to the statement (the above was the first case of neighbor fractions I tried where $b\neq c$), and a counter example would have meant that a proof was impossible.

Once you know the original isn’t correct, finding the correct version is optional and more difficult. You could try googling for the book’s errata (I was unsuccessful). You could also try rearranging the $\frac{a+b}{c+d}$ to get a correct statement (on the assumption that the original must have been close to the truth), and then see if you can prove a statement that matches a correct example. Or you could decide that since you don’t know what the correct statement actually is, it may as well be anything from the trivially easy to the impossibly hard, and you can put down your pencil.

Just so you know, it helps a good deal if at least one parent goes through the same exercises as the child. It may be hard; however, purchasing a book may not be enough. Given your profile, be aware that mathematics and computer science are really not the same thing. The example that comes up over and over again on this site is that of equivalence relations, especially the integers modulo $m$ for some $m.$ If the student is only able to think in terms of the computer command n % m, important nuances are missed.

I can add this: given neighbor fractions, and a positive integer $k,$ the fraction $$ \frac{a + kc}{b + kd} $$ is a neighbor to at least one of them (cannot remember, probably the second) and lies between them. In fact, if you also had $m,$ similar outcome for $$ \frac{ma + kc}{mb + kd} $$

The main examples of neighboring fractions are sequences called Farey fractions. https://en.wikipedia.org/wiki/Farey_sequence

Another example, not quite the same, is the convergents of simple continued fractions. Continued fractions: convergence of fraction expansion

$$ \begin{array}{ccccccccccccccccccccccc} & & 1 & & 1 & & 2 & & 1 & & 1 & & 4 & & 1 & & 1 & & 6 & \\ \frac{0}{1} & \frac{1}{0} & & \frac{1}{1} & & \frac{2}{1} & & \frac{5}{3} & & \frac{7}{4} & & \frac{12}{7} & & \frac{55}{32} & & \frac{67}{39} & & \frac{122}{71} & & \frac{799}{465} \\ \end{array} $$

We have to prove that for positive integers $a,b,c,d$, we either have

$$\frac{a}{b}<\frac{a+c}{b+d}<\frac{c}{d}$$

or

$$\frac{c}{d}<\frac{a+c}{b+d}<\frac{a}{b}$$

First of all, $\frac{a}{b}=\frac{a+c}{b+d}$ is equivalent to $ab+ad=ab+bc$, hence $ad=bc$, which contradicts the assumption $ad-bc=\pm 1$. We can disprove $\frac{a+c}{b+d}=\frac{c}{d}$ in the same manner.

In the case of $\frac{a}{b}<\frac{a+c}{b+d}$, we get $ad<bc$, hence $ad-bc=-1$. The condition $\frac{a+c}{b+d}<\frac{c}{d}$ is equivalent to $ad+cd<bc+cd$, hende $ad<bc$, which implies $ad-bc=-1$ again. So, $\frac{a}{b}<\frac{a+c}{b+d}$ is equivalent to $\frac{a+c}{b+d}<\frac{c}{d}$.

So, if we have $\frac{a}{b}>\frac{a+c}{b+d}$, we must have $\frac{a+c}{b+d}>\frac{c}{d}$ (which can also be proven directly analogue to the calculation above)

To show that the middle fraction is a neighbor-fraction to both fractions, just use the definition of neighbor-fractions.