GCD-LCM
1. Let and be positive integers such that ,
, , and . Which of the following must be a divisor
of ?
Solution
2. A group of pirates agree to divide a treasure chest of gold coins among themselves as
follows. The pirate to take a share takes of the coins that remain in the chest. The
number of coins initially in the chest is the smallest number for which this arrangement will
allow each pirate to receive a positive whole number of coins. How many coins does
the pirate receive?
Solution
3. There are exactly ordered quadruplets such
that and . What is the smallest possible value
for ?
Solution
4. Two farmers agree that pigs are worth $300 and that goats are worth $210. When one
farmer owes the other money, he pays the debt in pigs or goats, with "change" received in
the form of goats or pigs as necessary. (For example, a $390 debt could be paid with two
pigs, with one goat received in change.) What is the amount of the smallest positive debt
that can be resolved in this way?
Solution