Let N ε denote the maximum number of spikes that a solution to Carrier's problemcan have, where ε is a small positive parameter. We show that N ε is asymptotically equal to [K/ε], where K = 0.4725· · ·, and the square brackets represent the greatest integer less than or equal to the quantity inside. If n(ε) stands for the number of solutions to this problem, then it is also shown that 4N ε − 3 ≤ n(ε) ≤ 4N ε . Our approach is based on the shooting method used by Ou and Wong (Stud. Appl. Math. 111 (2003)) and on the construction of an envelope function for the minimum values of the solutions as ε approaches zero.