Let try THIS!! part 2
1)Smart Kid Kindergarten had organized their mega gathering with all their branches all over Malaysia. Each branch was grouped together and will divide equally but some of the kids will help their teacher. For first game, 5 kids help the teachers while others were dividing into 6 equally. For second game, 4 kids help the teacher, and others divide into 11 equally. For third game, 3 kids help the teacher and others 17 equally. Thus, what is the least number of kids in the gathering?
2)A band of 17 pirates stole a sack of gold coins. When they tried to divide the fortune into equal portions, 3 coins remained. In the ensuing brawl over who should get the extra coins, one pirate was killed. The wealth redistributed, but this time an equal division left 10 coins. Again an argument develop, another pirate was killed. But now the total was evenly distributed among the pirates. What was the least number of gold coins that could have been stolen?
hint;
~Chinese Remainder Theorem
~Euclidean Algorithm
~Linear Combination
0 comments:
Post a Comment