Questions


September 2022 1 2 Report
UITO alors (MELC 3) Uume and non routine problems involving factors, multiples, and divisibility rules for 2,3,4,5,6,8,9,10,11, and 12 (MELC 4) Activty 1 - Choose Me! A. Read and answer. Choose the letter of the best answer on what divisibility rules you should use. Encircle the letter of the correct answer. 1. Mrs. Luna has 44 desks in her classroom. She wants to arrange the desks equally, how many rows could Mrs. Luna make? A. Divisibility rules of 4 and 8 B. Divisibility rules of 4 and 12 C. Divisibility rules of 4 and 11 D. Divisibility rules of 8 and 12 2. There are 480 balloons in the party supply warehouse. Each bag contains the same number of balloons. How many bags of balloons could there be? A. Divisibility rules of 4 and 8 B. Divisibility rules of 4 and 12 C. Divisibility rules of 4 and 11 D. Divisibility rules of 4, 8, and 12 3. Maria made 204 peach desserts. She arranged the desserts with same number on platters. How many desserts could Maria have put on each platter? A. Divisibility rules of 4 B. Divisibility rules of 4 and 12 C. Divisibility rules of 4, 8, and 12 D. Divisibility rules of 4, 11, and 12 4. Ruel has 5,024 marbles to put into giant jars. He wants to put the same number of marbles in each jar with no extra marbles. How many jars are needed by Ruel? A. Divisibility rules of 4 and 8 B. Divisibility rules of 4 and 12 C. Divisibility rules of 4, 8, and 12 D. Divisibility rules of 4, 11, and 12 5. An office supply company needs to ship an order of 696 pencils. The company will ship the order in several boxes. Each box must contain the same number of pencils. How many boxes could the company use to ship the order? A. Divisibility rules of 4 and 8 Divisibility rules of 4 and 12 Divisibility rules of 4, 8, and 12 D. Divisibility rules of 4, 11, and 12​

Answers & Comments


Add an Answer


Please enter comments
Please enter your name.
Please enter the correct email address.
You must agree before submitting.

Helpful Social

Copyright © 2024 EHUB.TIPS team's - All rights reserved.