Can the numbers 1,1,2,2,…,1986,19861, 1, 2, 2, \dots, 1986, 19861,1,2,2,…,1986,1986 be arranged in a row such that there is one number between the two 1's, two numbers between the two 2's, ⋯\cdots⋯, and 1986 numbers between the two 1986's?
Jerry has ten distinguishable coins, each of which currently has heads facing up. He chooses one coin and flips it over, so it now has tails facing up. Then he picks another coin (possibly the same one as before) and flips it over. How many…
A student drew a 50×5050 \times 5050×50 empty table and wrote a number above each column and to the left of each row. It turned out that all 100 numbers written are different, with 50 of them being rational and 50 being irrational. Then, in each ce…
Prove that the number of partitions of a set, denoted by S(n,k)S(n, k)S(n,k), satisfies the recurrence relation S(n+1,k)=S(n,k−1)+k⋅S(n,k)S(n+1, k) = S(n, k-1) + k \cdot S(n, k)S(n+1,k)=S(n,k−1)+k⋅S(n,k) for 1≤k≤n1 \leq k \leq n1≤k≤n. Use this relation to calculate S(5,3)S(5, 3)S(5,3).
Soda is sold in packs of 8, 15, and 32 cans. What is the minimum number of packs needed to buy exactly 120 cans of soda?
How many whole numbers from 1 through 51 are divisible by either 4 or 6 or both?
How many 48-tuples of positive integers (a1,a2,…,a48)\left(a_1, a_2, \ldots, a_{48}\right)(a1,a2,…,a48) between 0 and 100 inclusive have the property that for all 1≤i<j≤48,ai∉{aj,aj+1}1 \leq i < j \leq 48, a_i \notin \left\{a_j, a_j + 1\right\}1≤i<j≤48,ai∈/?
Compute the number of ways to rearrange nine white cubes and eighteen black cubes into a 3×3×33\times 3\times 33×3×3 cube such that each 1×1×31\times1\times31×1×3 row or column contains exactly one white cube. Note that rotations are considered…
In two departments of the "Phantasmagoria" laboratory, mobile applications are being developed for Android and iOS. On one working day, all employees of these departments exchanged a certain number of messages. Each developer from the Andro…
A marble is placed on each 333333 unit square of a 10∗1010*1010∗10 chessboard. After that, the number of marbles in the same row or column with that square is written on each of the remaining empty unit squares. What is the maximum sum of the num…
Is it possible to write one of the 10 digits 0, 1, 2, ..., 9 at each vertex of a regular 45-gon, such that for any two different digits among these 10 digits, there exists an edge of the 45-gon with these two digits written at its endpoints…
Select different numbers from 1,2,3,⋯ ,91, 2, 3, \cdots, 91,2,3,⋯,9 such that their sum equals 17. How many different selections are possible?
In the central cell of a 21×2121 \times 2121×21 board, there is a piece. In one move, the piece can be moved to an adjacent cell sharing a side. Alina made 10 moves. How many different cells can the piece end up in?
Find the sum of the areas of all distinct rectangles that can be formed from 9 squares (not necessarily all), if the side of each square is 1 cm1 \text{ cm}1 cm.
Peter has a deck of 100110011001 cards, and with a blue pen he has written the numbers 1,2,…,10011,2,\ldots,10011,2,…,1001 on the cards (one number on each card). He replaced cards in a circle so that blue numbers were on the bottom side of the card. Then, for…
There is a 9×20049 \times 20049×2004 grid, where each integer from 1 to 2004 is filled in 9 times. Additionally, within each column, the count of each number filled does not exceed 3. Find the minimum possible sum of the numbers in the first row.
In how many ways can the number nnn be represented as the sum of two positive integers, considering representations that differ only by the order of the summands as identical?
Let a, b∈Z+a, \ b \in \mathbb{Z_{+}}a, b∈Z+ . Denote f(a,b)f(a, b)f(a,b) the number sequences s1, s2, ..., sas_1, \ s_2, \ ..., \ s_as1, s2, ..., sa , si∈Zs_i \in \mathbb{Z}si∈Z such that ∣s1∣+∣s2∣+...+∣sa∣≤b|s_1|+|s_2|+...+|s_a| \le b∣s1∣+∣s2∣+...+ . Show that f(a,b)=f(b,a)f(a, b)=f(b, a)f(a,b)=f(b,a) .
A random walk of a point starts from the origin on a line and makes aaa steps to the right, bbb steps to the left in some order, with a>ba > ba>b. The range of the walk is defined as the difference between the highest and lowest coordina…
Consider a six-digit palindrome of the form abccba‾\overline{abccba}abccba, where a,b,ca, b, ca,b,c are digits, and a≠0a \neq 0a=0. Let TTT be the sum of all six-digit palindromes. Find the sum of the digits in TTT.