posted by Anonymous .
Adan drew 2 same size rectangles and divided them into the same number of equal parts. He shaded 1/3 of one rectangle and 1/4 of the other rectangle. What is the least number of parts into which both rectangles could be divided?
LCM(3,4) = 12
He could make 3 vertical strips on each rectangle, then 4 horizontal strips on them. That way he would have the same number of small areas, and by shading in the horizontal strips on one and the vertical strips on the other the fractions involved could be used.
maybe he could use common deominator and figure out the equal shading