Answer:
Step-by-step explanation:
Let the number of jars is x.
<u>80 liters distributed, each jar has:</u>
<u>Redistribution with 4 less jars, each jar now has:</u>
<u>Each jar has now twice the amount:</u>
- 80/x*2 = 80/(x - 4)
- 2/x = 1/(x - 4)
- 2(x - 4) = x
- 2x - 8 = x
- x = 8
She prepared 8 jars at the start
15 i am pretty sure i’m probably gonna be wrong
Answer:
See below in bold.
Step-by-step explanation:
1. 0.00000402
= 4.02 * 10^-6 (Counting the digits after the decimal point until we get to the 4 gives us the -6).
2. 1,900,000
= 1.9 * 10^6 ( counting the number of digits after the 1 gives us 6).
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.
