It would be the first one (x,-y) because say for example you take the point of v1 (4,-1) and reflect across x axis you get (4,1) for v
12x > 9(2x-3)-15
distribute the 9
12x > 18x-27 -15
combine like terms on the right side
12x > 18x-42
subtract 18x from both sides
-6x > -42
divide both sides by -6
x = -42 / -6 = 7
x >7
Since you mentioned the fundamental counting principle, I assume you are looking for the total number of possibilities.
If you are picking a month, there are 12 options.
If you are selecting a day of the week, there are 7 options.
If you are doing both, you multiply the two numbers together.
12 x 7 = 84
Answer:
First let's define what modular arithmetic is, what would come is an arithmetic system for equivalence classes of whole numbers called congruence classes.
Now, the modular division is the division in modular arithmetic.
Answering the question, a modular division problem like ordinary arithmetic is not used, division by 0 is undefined. For example, 6/0 is not allowed. In modular arithmetic, not only 6/0 is not allowed, but 6/12 under module 6 is also not allowed. The reason is that 12 is congruent with 0 when the module is 6.