A company produces tickets that are individually numbered. The first ticket is numbered 1, the second ticket is numbered 2, etc...
You get a ticket numbered n. Knowing nothing else, we wish to estimate N, the total number of tickets produced. What is the best estimate of N? n would appear like a candidate although it would definitely be a biased estimate as it represents the lower bound. Maybe 2n? Maybe half-way between the lower and upper bounds (that would be ∞)? Does the question even make sense?
This sound a lot like the German-Tank-Problem: https://en.wikipedia.org/wiki/German_tank_problem
The minimum variance unbiased estimator is (see also https://web.archive.org/web/20140223104835/http://www.rsscse-edu.org.uk/tsj/wp-content/uploads/2011/03/johnson.pdf for more explanation):
$m(1 + k^{-1}) - 1$ with
$m$: Highest Oberved Number
$k$: Observations, in your case 1.