Answer:
JKL = PQR and JKL = PQR
Step-by-step explanation:
Answer:
Part c: Contained within the explanation
Part b: gcd(1200,560)=80
Part a: q=-6 r=1
Step-by-step explanation:
I will start with c and work my way up:
Part c:
Proof:
We want to shoe that bL=a+c for some integer L given:
bM=a for some integer M and bK=c for some integer K.
If a=bM and c=bK,
then a+c=bM+bK.
a+c=bM+bK
a+c=b(M+K) by factoring using distributive property
Now we have what we wanted to prove since integers are closed under addition. M+K is an integer since M and K are integers.
So L=M+K in bL=a+c.
We have shown b|(a+c) given b|a and b|c.
//
Part b:
We are going to use Euclidean's Algorithm.
Start with bigger number and see how much smaller number goes into it:
1200=2(560)+80
560=80(7)
This implies the remainder before the remainder is 0 is the greatest common factor of 1200 and 560. So the greatest common factor of 1200 and 560 is 80.
Part a:
Find q and r such that:
-65=q(11)+r
We want to find q and r such that they satisfy the division algorithm.
r is suppose to be a positive integer less than 11.
So q=-6 gives:
-65=(-6)(11)+r
-65=-66+r
So r=1 since r=-65+66.
So q=-6 while r=1.
When a tangent line (13.5 cm) and a secant (lines x + 8.45 cm) intersect then:
tangent line^2 = 8.45 * (8.45 + x)
13.5^2 = 71.4025 + 8.45 x
182.25 -71.4025 = 8.45x
8.45 x = 110.8475
x = 13.1180473373
x = 13.1 (rounded)
Source:
1728.com/circangl.htm
Answer:
Step-by-step explanation:
The way I like to think about it, with absolute value meaning the distance is
"find which number are 16 apart from 12". Which means 28 (to the right) or -4 (to the left).
More formally, applying the definition of absolute value,
Answer:
Step-by-step explanation:
x=2,−5,5
