Answer:
depends which way you rotate it
Step-by-step explanation:
counterclockwise rotation: (6,5)
clockwise rotation: (-6,-5)
Answer: C
Step-by-step explanation: Hope this help :D
When
, we have


and of course 3 | 6. ("3 divides 6", in case the notation is unfamiliar.)
Suppose this is true for
, that

Now for
, we have

so we know the left side is at least divisible by
by our assumption.
It remains to show that

which is easily done with Fermat's little theorem. It says

where
is prime and
is any integer. Then for any positive integer
,

Furthermore,

which goes all the way down to

So, we find that

QED
It is 2 because no variable
Answer:
p = 5 and b = 8
Step-by-step explanation:
First, create a system of equations:
2p + 4b = 42
7p + 9b = 107
Solve by elimination by multiplying the top equation by -7 and the bottom equation by 2:
-14p - 28b = -294
14p + 18b = 214
Add these together, and solve for b:
-10b = -80
b = 8
Plug in 8 as b into one of the equations, and solve for p:
2p + 4b = 42
2p + 4(8) = 42
2p + 32 = 42
2p = 10
p = 5
So, p = 5 and b = 8