To solve this problem, let us first lay out all the
factors of each number.
48 : 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
56 : 1, 2, 4, 7, 8, 14, 28, 56
The greatest number of bouquets that can be made would be
equal to the greatest common factor of the two numbers. In this case it would
be 8.
Answer:
<span>8 bouquets</span>
Answer:
84? Not sure but pretty sure
Step-by-step explanation:
In a straight line, the word can only be spelled on the diagonals, and there are only two diagonals in each direction that have 2 O's.
If 90° and reflex turns are allowed, then the number substantially increases.
Corner R: can only go to the adjacent diagonal O, and from there to one other O, then to any of the 3 M's, for a total of 3 paths.
2nd R from the left: can go to either of two O's, one of which is the same corner O as above. So it has the same 3 paths. The center O can go to any of 4 Os that are adjacent to an M, for a total of 10 more paths. That's 13 paths from the 2nd R.
Middle R can go the three O's on the adjacent row, so can access the three paths available from each corner O along with the 10 paths available from the center O, for a total of 16 paths.
Then paths accessible from the top row of R's are 3 +10 +16 +10 +3 = 42 paths. There are two such rows of R's so a total of 84 paths.
Answer:
$8145
Step-by-step explanation:
=6380(1+0.031)^8
=$8145
Answer:The first one
Step-by-step explanation:
V rectangular prism = Area of the base *5
