it will take 1.33 hours for Braydon and Lauren to get to the same mile marker on the path in the park .
<u>Step-by-step explanation:</u>
Here we have , Braydon can run at 3 miles per hour , he's initially at 10 mile marker . Lauren is at the 12-mile marker at the park, She is walking at a pace of 1.5 miles per hour. We need to find How long will it take for Braydon and Lauren to get to the same mile marker on the path in the park .Let's find out:
Let after time t they meet each other so , Braydon can run at 3 miles per hour , he's initially at 10 mile marker . Distance traveled is given by :
⇒ 
Now , Lauren is at the 12-mile marker at the park, She is walking at a pace of 1.5 miles per hour , Distance traveled is given by :
⇒ 
Equating both we get :
⇒ 
⇒ 
⇒ 
⇒ 
Therefore , it will take 1.33 hours for Braydon and Lauren to get to the same mile marker on the path in the park .
Answer:
the answer is D
Step-by-step explanation:
I just took a test
Answer:
Below in bold.
Step-by-step explanation:
c) 3 x (9^2)^3/4 x ((81^3)^5/6
= 3 x 81^3/4 x 81^15/6
= 3 x 81^(3/4 + 15/6)
= 3 x 81^13/4
= 3 x 3^13
= 3^14
= 4,782,969.
f) (5x^-1y^2)^-2 / (25 x^2 y - 1)^2
= 5^-2 x^2y^-4 / 625 x^4y^-2
= 5^-2 x^-2 y^-2 / 5^4
= 5^-6 x^-2y^-2
= 0.000064x^-2y^-2.
Assuming a d-heap means the order of the tree representing the heap is d.
Most of the computer applications use binary trees, so they are 2-heaps.
A heap is a complete tree where each level is filled (complete) except the last one (leaves) which may or may not be filled.
The height of the heap is the number of levels. Hence the height of a binary tree is Ceiling(log_2(n)), for example, for 48 elements, log_2(48)=5.58.
Ceiling(5.58)=6. Thus a binary tree of 6 levels contains from 2^5+1=33 to 2^6=64 elements, and 48 is one of the possibilities. So the height of a binary-heap with 48 elements is 6.
Similarly, for a d-heap, the height is ceiling(log_d(n)).
Answer:
564 patrons.
Step-by-step explanation:
20,304/36 = 564
