Taking over his thoughts is the answer
Answer:
The smallest positive integer solution to the given system of congruences is 30.
Step-by-step explanation:
The given system of congruences is


where, m and n are positive integers.
It means, if the number divided by 5, then remainder is 0 and if the same number is divided by 11, then the remainder is 8. It can be defined as



Now, we can say that m>n because m and n are positive integers.
For n=1,


19 is not divisible by 5 so m is not an integer for n=1.
For n=2,



The value of m is 6 and the value of n is 2. So the smallest positive integer solution to the given system of congruences is

Therefore the smallest positive integer solution to the given system of congruences is 30.
Answer:
-11
General Formulas and Concepts:
<u>Pre-Algebra</u>
Order of Operations: BPEMDAS
- Brackets
- Parenthesis
- Exponents
- Multiplication
- Division
- Addition
- Subtraction
Step-by-step explanation:
<u>Step 1: Define</u>
x² + 9x + 3
x = -2
<u>Step 2: Evaluate</u>
- Substitute in <em>x</em>: (-2)² + 9(-2) + 3
- Exponents: 4 + 9(-2) + 3
- Multiply: 4 - 18 + 3
- Subtract: -14 + 3
- Add: -11
Answer:
the answer is C
Step-by-step explanation:
the y intercept is on the right, so (x, y)
and the third option has (4,8) so 8 is on the y