Given that $e^x$ is strictly convex, I was asked to prove that
$$\sqrt[n]{a_1a_2a_3\cdots a_n} \le \dfrac{a_1 + a_2 + a_3+\cdots +a_n} n, \qquad a_1,a_2,a_3,\ldots,a_n > 0$$
I have not seen the relationship between $e^x$ convexity and the above inequality. How do I connect these two concepts?
I think you actually are looking for the AM-GM inequality (https://en.wikipedia.org/wiki/Inequality_of_arithmetic_and_geometric_means) instead. There are easy counter-examples to the inequality you mention. The exponential or the logarithm function is generally used to move between additive and multiplicative means.
Define $a_i=\exp x_i$
(What condition makes sure that we can always write this step?)
Use the Jensen's inequality here:
$$ \exp (\frac 1 n \sum x_i) \leq (\frac 1 n \sum (\exp x_i))$$