At the moment, I don't know how it can be simplified.
Well, the following "corrupted" system can be proposed as an exam task with the "reasonable" answer:

The difference from the original system is that now we have the coefficients

and

instead of

and

, correspondly. The problem can be formulated as: find the number of solutions over

for an arbitrary prime

. The required (expected) answer must be given explicitly: this means that the primes

for which we have the same number of solutions must be desribed explicitly (for examle: those primes have the form ...).