Use the Chinese remainder theorem. Suppose we set
. Then clearly taken modulo 12, the second term vanishes, and incidentally
; taken modulo 13, the first term vanishes, but the second term leaves a remainder of 2. To counter this, we can multiply the second term by the inverse of 12 modulo 13, which is 12 since
.
So, we found that
, but the least positive solution is
, and in general we can have
for any integer
.
Now, since
, or
, we know that there are 32 possible integers
that satisfy the congruences.
You gave $30.
[$30 * 0.20] (tip % amount) = $6.
You left $6 in tips.
Answer:
Pentagon G'P'E'S'T' is smaller than pentagon pentagon GPEST because the scale factor is less than 1.
Step-by-step explanation:
Sorry im late homie
Answer:
200 and 546
Step-by-step explanation:
dejar a = Primer periodo (first term)
dejar d = Diferencia común (common difference)
dejar 100th término = T100
dejar 273 término = T 273
utilizando
Tn = a + (n - 1)d
T100 = 2 + (100 - 1) 2
= 2 + 99 ×2
= 2 + 198
= 200
T273 = 2 + (273 - 1) 2
= 2 + 272 × 2
= 2 + 544
= 546
Answer:
-3
Step-by-step explanation:
-(-3) = 3
-(-6) = 6
-3 - (-6) = 3
-c - d
c = -3
-3 - d
d = -6
-3 - (-6)
=-3+6
=3
