Depends how strong the bomb is. If the bomb is weak then you would most likely go up 20-30 floors. If the bomb is in the middle go to the stair case and prepare for impact. If the bomb is strong go down 40 floors if possible. If none of this is possible to do and you don't know what to do about it then you must do the following:
Cut all of the wires in the bomb. Get the bomb near of a wall or a window. If it is a window then throw the bomb out of the window. If it is a wall put it as close to the wall as possible gather all your coworkers and run off of the floor.
Hope this helps!
Answer:
Jonathan is deciding between two truck rental companies. Company A
charges an initial fee of go for the rental plus $1 per mile driven
Company B charges an initial fee of $10 for the rental plus $1.50 per
mile driven. Let A represent the amount Company A would charge if
Jonathan drives s miles, and let B represent the amount Company B
would charge if Jonathan drives s miles, Graph each function and
determine which company would be cheaper if Jonathan needs to
drive 60 miles with the rented truck,
Answer:
If an equation has one solution, what will the variable terms be
b. different
Answer: 17-3.99a
Step-by-step explanation:
Remove parentheses.
17- 0.07a- 3.92a17−0.07a− 3.92a
Collect like terms.
17+(−0.07a−3.92a)
Simplify.
17−3.99a
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.
