Answer:
0.7233
Step-by-step explanation:
We want to find the area between the z-scores z=-0.95 and z=1.25.
We first find the area to the left of each z-score, and subtract the smaller area from the bigger one.
For the area to the left of z=-0.95, we read -0.9 under 5 from the standard normal distribution table.
This gives P(z<-0.95)=0.1711
Similarly the area to the left of z=1.25 is
P(z<1.25)=0.8944
Now the area between the two z-scores is
P(-0.25<z<1.25)=0.8944-0.1711=0.7233
Answer:
The amount of sale is approximately 5714.
Step-by-step explanation:
Let x be the sales made that will result to the same salary and let y be the same weekly salary.
We can represent both salaries as follows:
300 + 0.04x = y
100 + 0.075x = y
Subtracting the second equation from the first, we have:
200 – 0.035x = 0
0.035x= 200
x = 200/0.035
x ≈ 5714.
Therefore, the amount of sale is approximately 5714.
Well, kid all you have to do is add like terms and place the subjected terms in alphabetical order.
1. (6y-2c+2)+(-3y+4c)
2. 6y + - 3y = 3y
3. -2c+4c =2c
4. the positive in the first set of parenthesis has to term other than its number by itself. (so it remains alone and only positive 2)
5. take all the separate term answers and add them into a complete expression- 3y + 2c + 2: and that is all
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.
