Problems

Age
Difficulty
Found: 15

Prove the divisibility rule for \(3\): the number is divisible by \(3\) if and only if the sum of its digits is divisible by \(3\).

In a country far far away, there are only two types of coins: 1 crown and 3 crowns coins. Molly had a bag with only 3 crown coins in it. She used some of these coins to buy herself hat and she got one 1 crown coin back. The next day, all of her friends were jealous of her hat, so she decided to buy identical hats for them. She again only had 3 crown coins in her purse, and she used them to pay for 7 hats. Show that she got a single 1 crown coin back.

If natural numbers \(a,b\) and \(c\) are lengths of the sides of a right triangle (such that \(a^2+b^2=c^2\)), show that at least one of these numbers is divisible by \(3\).

Tom got a really bad grade from the last test and once he got the test back, he started to tear it up. He is tearing it into little pieces in the following manner: He picks up a piece and tears it into either \(4\) or \(10\) smaller pieces. Can he eventually have exactly 200,000 pieces?