Find the smallest natural $ k $ such that among any $ k $ distinct and pairwise coprime naturals smaller than $ 2018, $ a prime can be found.


[i]Vlad Robu[/i]
1. **Define the problem and notation:**
   We need to find the smallest natural number \( k \) such that among any \( k \) distinct and pairwise coprime natural numbers smaller than 2018, at least one of them is a prime number.

2. **Prime numbers and their squares:**
   Let \( \mathbb{P} \) denote the set of all prime numbers. We consider the set of squares of primes less than 2018. The largest prime \( p \) such that \( p^2 < 2018 \) is 43, because \( 43^2 = 1849 \) and \( 47^2 = 2209 \).

3. **Counting the relevant primes:**
   The number of primes less than or equal to 43 is 14 (these primes are: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43). Including 1, we have 15 numbers in the set \( \{ p^2 \mid p \in \mathbb{P}, p^2 < 2018 \} \cup \{1\} \).

4. **Applying the pigeonhole principle:**
   Suppose we have a set \( S \) of 16 distinct and pairwise coprime natural numbers smaller than 2018. Assume all numbers in \( S \) are composite except possibly 1. For each composite number \( n \in S \), let \( f(n) \) be the smallest prime divisor of \( n \). If \( n \) is composite and \( n < 2018 \), then \( f(n) \leq 43 \).

5. **Counting the smallest prime divisors:**
   Since there are 14 primes less than or equal to 43, and including 1, we have 15 possible values for \( f(n) \). By the pigeonhole principle, if we have 16 numbers in \( S \), at least two of them must share the same smallest prime divisor, say \( f(x) = f(y) \) for \( x \neq y \).

6. **Contradiction:**
   If \( x \) and \( y \) share the same smallest prime divisor, they cannot be coprime, which contradicts the assumption that all numbers in \( S \) are pairwise coprime.

7. **Conclusion:**
   Therefore, the assumption that all numbers in \( S \) are composite is false. Hence, \( S \) must contain at least one prime number.

The final answer is \(\boxed{16}\).