Answer: 5
Explanation:
Given : Jerome has two bags of different candies, one with 15 pieces of candy and one with 20 pieces.
Every prize will have one kind of candy, the same number of pieces.
Then to find the greatest number of pieces of candies possible in each price , we need to find the greatest common factor of 15 and 20.
Prime factorization of 15 and 20 :-
∴ Greatest common factor of 15 and 20 = 5
Hence , the greatest number of pieces of candies possible in each prize = 5