Answer:
I think the figure of N and E of 48in is 2304. The figure of I and E and N and A of 32in is 1024. The figure of L and I and L and A is 144.
Step-by-step explanation:
To find the area, you have to multiply of each side in each figure. For example, Figure A and B and C and D of 16in is 16 × 16 which is 256.
A = Area
a = Side
A = 2304, A = a^2 = 48^2 = 2304.
A = 1024, A = a^2 = 32^2 = 1024.
A = 144, A = a^2 = 12^2 = 144.
I hope this answers your question!
Answer:
89 rooms should be set for early book customer
Step-by-step explanation:
According to the given data we have the following:
OVERAGE(CO) = 200
SHORTAGE(CS) = 500
In order to calculate how many rooms should be set for early book customer we would have to use the following formula:
OPTIMAL BOOKING = MEAN + (Z * STDEV)
MEAN = 75
STDEV = 25
SERVICE LEVEL= CS / (CS + CO) = 500 / (500 + 200) = 0.7143
Z VALUE FOR 0.7143 = 0.57
OPTIMAL BOOKING = 75 + (0.57 * 25) = 89
89 rooms should be set for early book customer
The answer is 7 1/3 hope it helps!
26×4=104
292-104=188
26÷2=13
188-13=175cm
the tree was 175cm when he moved in
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.
