Answer:
b. 58%
Step-by-step explanation:
Calculate the area of the entire rectangle using the formula A = lw.
The lowercase "L" is for length.
"w" is for width.
The lighter square is 10 units long by 5 inches wide.
A = lw
A = (10 in)(5 in) Multiply
A = 50 in²
Calculate the area for the shaded rectangle, 7 inches by 3 inches.
A = lw
A = (7 in)(3 in) Multiply
A = 21 in²
Calculate the area for the non-shaded region by subtracting the shaded area from the total area.
50 in² - 21 in² = 29 in²
The chance that a point in the large rectangle will NOT be in the shaded region is 29/50.
Convert this fraction to decimal form by using a calculator. Divide the top number by the bottom number.
29/50 = 0.58
0.58 is in decimal form. To convert it to a percentage, multiply the number by 100.
0.58 = 58%
Therefore the probability that a point chosen inside the large rectangle is not in the shaded region is 58%.
Answer:
8
Step-by-step explanation:
A family of 5 monkeys eat 2 bananas a day.
to figure out how much the monkeys will eat in 4 days
multiply 2 by 4.
make sure the question is not for each monkey or the answer will be
(2 by 4) by 5. witch would be 40
however for the case your saying the answer would be 8
Answer:
I can't see ;-; show close up
(a) The sum of length and width is half the perimeter, so the breadth in terms of length (x) in cm will be
.. breadth = 34 -x
(b) Then the expression for the area (in cm^2) is
.. area = length*breadth
.. 253 = (x)(34 -x)
.. x^2 -34x +253 = 0 . . . . . subtract the right side, eliminate parentheses
.. (x -11)(x -23) = 0 . . . . . . . factor
.. x = 11 or 23
The dimensions of the rectangle are 11 cm by 23 cm.
Problem 7)
The answer is choice B. Only graph 2 contains an Euler circuit.
-----------------
To have a Euler circuit, each vertex must have an even number of paths connecting to it. This does not happen with graph 1 since vertex A and vertex D have an odd number of vertices (3 each). The odd vertex count makes it impossible to travel back to the starting point, while making sure to only use each edge one time only.
With graph 2, each vertex has exactly two edges attached to it. So an Euler circuit is possible here.
================================================
Problem 8)
The answer is choice B) 5
-----------------
Work Shown:
abc base 2 = (a*2^2 + b*2^1 + c*2^0) base 10
101 base 2 = (1*2^2 + 0*2^1 + 1*2^0) base 10
101 base 2 = (1*4 + 0*2 + 1*1) base 10
101 base 2 = (4 + 0 + 1) base 10
101 base 2 = 5 base 10
