Answers ( 3 )
  • See question detail

    Let a (cm) be the largest possible square size

    => a = GCD (140 ; 240) = 20 

    So the largest size of the square's edge is 20 cm.Then the smallest number of squares can be cut from the cardboard is :

    140 x 240 : 202 = 84

    Answer : 20 cm ; 84 squares

  • See question detail

    It is difficult enough for me to do.Can you help me,please?

  • See question detail

    It is difficult enough for me to do.Can you help me,please?