Answer:George will receive $1200
first $100 payment which will included in his gross income.
Step-by-step explanation:
His gross income will be $100 per months multiple by 12months which will be his first $100 payment.
$100× 12=$1200
Cookies baked = 12 × 3 (number of trays) = 36
Bags = 4
In 4 bags = 36 cookies
in 1 bag = 36/4 = 9 cookies (divide both sides by 4)
SO 9 COOKIES WERE PLACED IN EACH BAG
hope this helped :)
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.
Answer:
2, 4
Step-by-step explanation:
Answer:Let the two unknown numbers be x and y.
So, x-y=40 ........Equation 1
And 0.3(x)= 37.5/100 (y)
From equation 1, x=40+y
Now, multiply through by 100 in equation 2.
We have,
30x = 37.5 (y)
We can multiply through by 10 again,so that the number on the L.H.S becomes a whole number.
Therefore, we have
300x = 375 (y)
Put "x=40+y" in the equation above
That is, 300 (40+y) = 375 (y)
1200 + 300y = 375y
1200 = 375y - 300y
1200 = 75y
Divide both sides by 75 to get your y
Therefore, y =16
From equation 1, we had x= 40 + y
Therefore X = 40 + 16
X= 56
Therefore the two unknown numbers are 56 and 16 respectively.
Step-by-step explanation:
