Cherries are on sale at the grocery store at a price of $5 for 2 pounds. Oscar buys 3
1 answer:
You might be interested in
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.
Since the area of a square is equal to the square of one of its side's length, then the area should be equivalent to 
.
---> equation (1)
By using pythagoras rule which states that the
---> equation (2)
where the opposite side's length is 8 and the hypotenuse side's length is 10
by substituting by the values in equation (2) therefore,
substitute this value in equation (1) then
where A is the area of the square whose side is x
By using pythagoras rule which states that the
where the opposite side's length is 8 and the hypotenuse side's length is 10
by substituting by the values in equation (2) therefore,
where A is the area of the square whose side is x