sorry, I copy and pasted it without realising it wouldn't come out properly. it should read ^21.
So the question is as follows:
. . . . .\(\displaystyle \mbox{Prove that, if }\, x\, \mbox{ and }\, y\, \mbox{ are integers such that}\)
. . . . .\(\displaystyle x\, \equiv\, 6\, \mbox{(mod 8) and }\, y\, \equiv\, 3\, \mbox{(mod 8), then }\, \)
. . . . .\(\displaystyle 8\, \mbox{ divides } \, 2\, (x\, +\, y)^{21}\, +\, 3xy\)
we haven't really been given specific formulas or theories for questions like this.
Then I guess you'll just have to work from the definition of congruency, mod 8, and create expressions which will allow you to show the result.
. . . . .x = 8m + 6
. . . . .y = 8n + 3
...and so forth. The result does follow.
![Wink ;) ;)](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)