Difference between revisions of "1998 JBMO Problems/Problem 4"
Duck master (talk | contribs) (created page with solution) |
Duck master (talk | contribs) m (deleted link to fifth problem) |
||
| Line 15: | Line 15: | ||
== See also == | == See also == | ||
| − | {{JBMO box|year=1998|num-b=3|after = Last Problem}} | + | {{JBMO box|year=1998|num-b=3|after = Last Problem|five=}} |
[[Category:JBMO]][[Category: Number Theory Problems]] | [[Category:JBMO]][[Category: Number Theory Problems]] | ||
Latest revision as of 00:14, 7 October 2020
Do there exist 16 three digit numbers, using only three different digits in all, so that the all numbers give different residues when divided by 16?
Solution
Let the three different digits be 
.
If all have the same parity, then all sixteen numbers will also have the same parity. But then they can only cover at most 8 residues modulo 16, so they cannot have distinct residues by the pigeonhole principle.
Suppose that do not all have the same parity. If two are even and one is odd, then twelve of the eighteen possible three-digit numbers formed with will be even and six will be odd. But this means that there are not enough odd numbers to fill the 8 odd residues modulo 16, so it will not be possible to select 16 three digit numbers with this property in this case.
Similarly, if two are odd and one is even, then twelve of the eighteen possible three-digit numbers formed with will be odd and six will be even. But this means that there are not enough even numbers to fill the 8 even residues modulo 16, so it will not be possible to select 16 three digit numbers with this property in this case.
Therefore, we conclude that it is impossible to select 16 such numbers.
See also
| 1998 JBMO (Problems • Resources) | ||
| Preceded by Problem 3 |
Followed by Last Problem | |
| 1 • 2 • 3 • 4 | ||
| All JBMO Problems and Solutions | ||
