Since only even numbers are allowed, we can write the number of balloons each child receives as:
\[ 2a,\quad 2b,\quad 2c,\quad 2d \quad \text{where } a, b, c, d \in \mathbb{N} \]
Then the total becomes: \[ 2a + 2b + 2c + 2d = 20 \Rightarrow a + b + c + d = 10 \]
So the original problem is transformed into: How many ways can 4 positive integers sum up to 10?
The number of ways to partition a number \( n \) into \( r \) positive integers is given by:
\[ \text{Number of solutions} = \binom{n - 1}{r - 1} \]
In our case: \[ n = 10, \quad r = 4 \Rightarrow \binom{10 - 1}{4 - 1} = \binom{9}{3} \]
Calculating: \[ \binom{9}{3} = \frac{9 \times 8 \times 7}{3 \times 2 \times 1} = 84 \]
There are exactly: \[ \boxed{84} \] ways to distribute 20 identical balloons among 4 children such that each gets a non-zero even number of balloons.
For any natural number $k$, let $a_k = 3^k$. The smallest natural number $m$ for which \[ (a_1)^1 \times (a_2)^2 \times \dots \times (a_{20})^{20} \;<\; a_{21} \times a_{22} \times \dots \times a_{20+m} \] is: