Answer:
1.77245385091
Step-by-step explanation:
lol I memorized it
In equations we always want to do the same thing to both sides so the equation stays equal
in an equation with one unknown (x) we try to get the unknown on one side
so -(x-10)
this means that you multiply everything in the equation by -1 or in other words you make everything in the parenthasees the opposite sign of what it is so
6x+3x-x+10=20x
add like terms
8x+10=20x
subtract 8x from boths sides
10=12x
divide both sides by 12
10/12=x=5/6
Answer:
Yes he lost 1 dollar
Step-by-step explanation:
First of all, the modular inverse of n modulo k can only exist if GCD(n, k) = 1.
We have
130 = 2 • 5 • 13
231 = 3 • 7 • 11
so n must be free of 2, 3, 5, 7, 11, and 13, which are the first six primes. It follows that n = 17 must the least integer that satisfies the conditions.
To verify the claim, we try to solve the system of congruences

Use the Euclidean algorithm to express 1 as a linear combination of 130 and 17:
130 = 7 • 17 + 11
17 = 1 • 11 + 6
11 = 1 • 6 + 5
6 = 1 • 5 + 1
⇒ 1 = 23 • 17 - 3 • 130
Then
23 • 17 - 3 • 130 ≡ 23 • 17 ≡ 1 (mod 130)
so that x = 23.
Repeat for 231 and 17:
231 = 13 • 17 + 10
17 = 1 • 10 + 7
10 = 1 • 7 + 3
7 = 2 • 3 + 1
⇒ 1 = 68 • 17 - 5 • 231
Then
68 • 17 - 5 • 231 ≡ = 68 • 17 ≡ 1 (mod 231)
so that y = 68.
267.05 hope this helpssss