Combine Like Terms- Use the Highlighting Tool
1 answer:
You might be interested in
Answer:
(a)
(b)
(c)
Step-by-step explanation:
The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.
The Euclidean algorithm solves the problem:
<em> Given integers </em><em>, find </em>
<em />
Here is an outline of the steps:
- Let
,
.
- Given
, use the division algorithm to write
.
- If
, stop and output
; this is the gcd of
.
- If
, replace
by
. Go to step 2.
The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.
Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:
Step 1: Subtract D from N repeatedly.
Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.
(a) To find we apply the Euclidean algorithm:
The process stops since we reached 0, and we obtain .
(b) To find we apply the Euclidean algorithm:
The process stops since we reached 0, and we obtain .
(c) To find we apply the Euclidean algorithm:
The process stops since we reached 0, and we obtain .
Answer:
1). t ≥ -
2). k ≥
3). y < -
4). b >
5). w ≤ 0
Step-by-step explanation:
1).
t ≥ -
2). 15k + 11 ≤ 18k - 5
15k - 18k ≤ -5 - 11
-3k ≤ - 16
3k ≥ 16
k ≥
3). 44y > 11 + 88y - 22y
44y > 11 + 66y
44y - 66y > 11
-22y > 11
22y < -11
y <
4).
(b - 27) >
b >
b >
5). 11w - 8w ≥ 14w
3w - 14w ≥ 0
-11w ≥ 0
w ≤ 0