First you write down what you know, ie the question in form of math notation:
For integers, a,b and c, where a<b<c, and (a+1) = mod 2, (b+1) = mod2, (c+1) = mod2. Solve for a,b,c, when 3(a+b+c) = 5 + 8b.
Alternatively, if you read the question, you're not meant to calculate the answer, just find a,b,c so that the statement is true. For example, is it true for a=1, b=2, c=3?
First you write down what you know, ie the question in form of math notation:
For integers, a,b and c, where a<b<c, and (a+1) = mod 2, (b+1) = mod2, (c+1) = mod2. Solve for a,b,c, when 3(a+b+c) = 5 + 8b.
Alternatively, if you read the question, you're not meant to calculate the answer, just find a,b,c so that the statement is true. For example, is it true for a=1, b=2, c=3?
It is too easy to be a engineering collage level problem. As a rule I get such things wrong so let me give it a try. If I am wrong I am sure there will be no shortage of people with the right answer.
Find three consecutive odd integers such that 3 times their sum is 5 more than 8 times the middle one
The queston asks for three consecutive odd integers,
I would thake this to be numbers like
x, x+2, x+4 where x is odd.
As always I complicate things, congruent modulo was not the way to go. (However, I conjecture that it would give you all solutions to the problem if they exist...)