Answer: length = 62 yards and width = 3 yards
Step-by-step explanation:
Answer:
5000 is the answer
Step-by-step explanation:
mark me brainliest
Answer:
<em>total</em><em>=</em><em>n÷m</em><em> </em><em>$</em><em>1</em><em>6</em><em>5</em><em>÷</em><em>1</em><em>5</em><em>,</em><em>$</em><em>2</em><em>3</em><em>1</em><em>÷</em><em>2</em><em>1</em><em> </em><em>and</em><em> </em><em>$</em><em>2</em><em>7</em><em>5</em><em>÷</em><em>2</em><em>5</em>
Answer: The greatest number of pages Kenji can decorate = 3
Step-by-step explanation:
Given: Total heart stickers = 15
Total star stickers =12
If all the papers identical, with the same combination of heart and star stickers and no stickers left over.
Then the greatest number of pages Kenji can decorate = GCD(15,12) [GCD=greatest common divisor]
Since 15 = 3 x 5
12=2 x 2 x 3
GCD(15,12) =3
Hence, the greatest number of pages Kenji can decorate = 3