I've been trying this problem for a bit now and I'm confused about what the notation even is. The previous problem was about recursive definitions and our teacher provides with powerpoints but I can't seem to find anything about this notation in them. I searched online for help but nothing comes up for me. Please, any help is greatly appreciated.
Thank you,
-jjleahy
EDIT:
Let S be the subset of the ordered pairs of integers defined recursively by:
Basis Step: (0,0) ∈ S
Recursive step: If (a,b) ∈ S, then (a + 2, b + 3) ∈ S and (a + 3, b + 2) ∈ S.
I think this can be done by induction on number of steps it takes to get to the tuple $(a,b)$ from $(0,0)$ by performing the two operations mentioned successively .
Base case: no operation is performed on $(0,0)$ and $5\mid (0+0)$. Now assume that all tuple you get by applying n successive mentioned operations to get to $(a,b)$, $5\mid a+b$. And you choose a tuple $(a,b)$ obtained from $n+1$ successive application of operations. Then either $(a-2,b-3) $ is in $S$ or $(a-3,b-2)$ is in $S$. Either way, $5\mid a-2+b-3$ and $5\mid 5$ implies $5\mid a+b$ or $5\mid a-3+b-2$ and $5\mid 5$ implies $5\mid a+b$.