Suppose a Poisson process $N(t)\sim\text{Poisson}(\lambda t)$. Let $T(N)$ be the time of the last arrival before time $t$ and $T(N+1)$ be the time of the first arrival after time $t$. From simulations, I believe that $T(N+1)-T(N)$ is a Gamma$(2,\lambda)$ and I have a sense that it has to do with the fact that $T(N+1)-t\sim\exp(\lambda)$ and $t-T(N)\sim\exp(\lambda)$ due to memorylessness but I don't know how to show it.
Specifically, I think I want to show that $t-T(N)$ is exponential and then consider the sum of the (independent?) random variables $T(N+1)-t$ and $t-T(N)$. Note: I have heard this referred to as the "Hitchhiker's Paradox."