Euclid's division lemma : Let a and b are two positive integers. There exist unique integers q and r such that
a = bq + r, 0 
r < b
Or We can write it as,
Dividend = Divisor × Quotient + Remainder
<u>Work</u><u> </u><u>out</u><u>:</u>
Given integers are 240 and 228. Clearly 240 > 228. Applying Euclid's division lemma to 240 and 228,
⇛ 240 = 228 × 1 + 12
Since, the remainder 12 ≠ 0. So, we apply the division dilemma to the division 228 and remainder 12,
⇛ 228 = 12 × 19 + 0
The remainder at this stage is 0. So, the divider at this stage or the remainder at the previous age i.e 12
<u>━━━━━━━━━━━━━━━━━━━━</u>
Answer:
$12,928.60
Step-by-step explanation:
We can use A = P(1 + r)^t to solve this
Step 1: Plug known variables
P = 12000(1 + 0.0125)^6
Step 2: Solve
P = 12000(1.0125)^6
P = 12928.6
And we have our final answer!
Answer:
22
Step-by-step explanation:
The segment addition theorem tells us the whole is the sum of the parts. We can use this to write an equation relating the expressions for segment length.
<h3>Setup</h3>
OQ = OP +PQ . . . . . segment addition theorem
4x +2 = (3x -3) +(4x -10) . . . . substitute given expressions
<h3>Solution</h3>
15 = 3x . . . . . . add 13 -4x to both sides
5 = x . . . . . . . divide by 3
OQ = 4x +2 = 4(5) +2 = 22
The length of OQ is 22 units.
Answer:
-11/24
Step-by-step explanation:
1/6 -5/8=-11/24
hope this helps u
Answer:
(3, –6)
Step-by-step explanation:
A function is a relation where one input is assigned to exactly one output.
This means that no inputs must be repeated in the relation.
(0, 2), (3, 8), (–4, –2), (3, –6), (–1, 8), (8, 3)
The input of '3' repeats in the relation.
By removing (3, -6), we can make the relation given a function.
Hope this helps.
