This question is based on least common multiple method.
As given in the question,
Aunts are taking pictures in group of = 5
Uncles are taking pictures in group of = 10
So we have been asked what is the minimum number of aunts Sana have.
As we have been given that the number of aunts and uncles is equal so to find the minimum number of aunts we will apply the least common multiple method.
So we get LCM of 5,10 as 10
Hence there are minimum 10 aunts.
Answer:
Step-by-step explanation:
A car traveled at a constant speed as shown in the graph.
Distance traveled is on the y-axis and duration of travel on the x-axis.
Point A(3.5, 210) shows,
Distance traveled = 210 miles
Time to travel = 3.5 hours
So the point (3.5, 210) shows the distance traveled by the car in 3.5 hours is 210 miles.
Slope of the line = speed of the car = 
= 
= 60 mph
Now we will find the speed of the car at another point B(1, 60).
If the speed of car is same as the point B as of point A, point B will lie on the graph.
Speed of the car at B(1, 60) = 
= 
= 60 mph
Hence, we can say that point B(1, 60) lies on the graph.
Answer:
4 large boxes and 2 small boxes
Step-by-step explanation:
4 X 55 =220 books
2 X 30 = 60 books
Total = 280 books
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.