Let $G$ be a $k$-connected graph on $n$ vertices. Hippchen's Conjecture states that two longest paths in $G$ share at least $k$ vertices. Gutiérrez recently proved the conjecture when $k\leq 4$ or $k\geq \frac{n-2}{3}$. We improve upon both results; namely, we show that two longest paths in $G$ share at least $k$ vertices when $k=5$ or $k\geq \frac{n+2}{5}$. This completely resolves two conjectures of Gutiérrez in the affirmative.