Upon the installation of a keypad lock, each of the 26 letters located on the lock’s keypad is assigned an arbitrary natural number known only to the owner of the lock. Different letters do not necessarily have different numbers assigned to them. After a combination of different letters, where each letter is typed once at most, is entered into the lock a summation is carried out of the corresponding numbers to the letters typed in. The lock opens only if the result of the summation is divisible by 26. Prove that for any set of numbers assigned to the 26 letters, there exists a combination that will open the lock.
Reception pupil Peter knows only the number 1. Prove that he can write a number divisible by 2001.
Is it possible to construct a 485 × 6 table with the integers from 1 to 2910 such that the sum of the 6 numbers in each row is constant, and the sum of the 485 numbers in each column is also constant?
What time is it going to be in \(2025\) hours from now?
Prove that the product of five consecutive integers is divisible by \(30\).
Prove that if \(n\) is a composite number, then \(n\) is divisible by some natural number \(x\) such that \(1 < x\leq \sqrt{n}\).
The natural numbers \(a,b,c,d\) are such that \(ab=cd\). Prove that the number \(a^{2025} + b^{2025} + c^{2025} + d^{2025}\) is composite.
Prove that for an arbitrary odd \(n = 2m - 1\) the sum \(S = 1^n + 2^n + ... + n^n\) is divisible by \(1 + 2 + ... + n = nm\).
Multiply an odd number by the two numbers either side of it. Prove that the final product is divisible by \(24\).
Mattia is thinking of a big positive integer. He tells you what this number to the power of \(4\) is. Unfortunately it’s so large that you tune out, and only hear that the final digit is \(4\). How do you know that he’s lying?