Let $G$ be a connected graph of order $n$. A $\{P_3,P_4,P_5\}$-factor is a spanning subgraph $H$ of $G$ such that every component of $H$ is isomorphic to an element of $\{P_3,P_4,P_5\}$. In this paper, we establish a sufficient condition on the size of the graph $G$ with minimum degree $δ$ to have a $\{P_3, P_4, P_5\}$-factor. Subsequently, we provide another sufficient condition on the adjacency spectral radius, ensuring that a connected graph $G$ with minimum degree $δ$ contains a $\{P_3, P_4, P_5\}$-factor.