What is the expected number of random small circles it takes to cover a large circle? I have a large circle of radius $B$. I choose a random point inside the large circle, and draw a small circle of radius $A$ around it ($A<B$). What are the chances that, after drawing $n$ such small circles, the union of their area covers the large circle (i.e., includes every point in the large circle)? What is the expected value of the number of small circles I must draw to cover the large circle?

My progress so far: If I pick any point in the large circle, the chance that it has not been covered by $n$ small circles is:
1 minus the chance that it has been covered
= 1 minus the chance that the origin of a small circle is within $A$ of this point, after $n$ tries
= 1 minus (the small circle of radius $A$ around this point divided by the total area of the large circle), after $n$ tries
= $\left(1 - \frac{\pi A^2}{\pi B^2}\right)^n$
= $\left(\frac{B^2 - A^2}{B^2}\right)^n$
So, the chance that any point has been covered is $1 - \left(\frac{B^2 - A^2}{B^2}\right)^n$. How do I use this info to know whether all point have been covered after $n$ small circles? And find the expected value of the number of small circles it takes?
Also, even this oversimplifies it: If the point I pick in the large circle is within $A$ away from the edge, a circle of radius $A$ around it isn't completely contained in $B$, so the ratio of "hits" is actually less than $\frac{A^2}{B^2}$. I assume we can calculate the amount of overlap for the "average" small circle, which is 100% for most of them but less than that (is it $\frac{3}{4}$?) for $\frac{A}{B}$ of them.

Here is a lower bound and an upper bound, for large values of $B/A$.  It is based on the Coupon Collector's problem.
For the lower bound, take as many non-overlapping circles of radius $A$ as possible.  In the hexagonal pattern, they will cover $k:=\pi\sqrt3/6$ of the area, so there will be about $M:=kB^2/A^2$ of them.  There must be a point in each of them so that all their centres are covered.  By the Coupon Collector, that will take about $M\ln M$ points.  Since some points lie in the gaps between circles, I expect $M(\ln M)/k$ points are needed.
For the upper bound, consider circles of radius $A/2$, again in a hexagonal pattern, but separated by $A\sqrt3/2$ instead of $A$ so they just cover the big circle. The area of a hexagon is $q:=3A^2\sqrt3/8$ so there are $N:=\pi B^2/q$ of them.  If there is a point in each small circle then each small circle is covered, so the big circle is covered.  This will take about $N\ln N$ points.  There is a chance that a point is in two of these circles, so I would reduce the expected number of points by a factor $p=(\pi A^2/4)/q$.
To conclude, I expect the answer, $n$ tries, to be in between
$$\frac{B^2}{A^2}\ln\left(\frac{\pi\sqrt3B^2}{6A^2}\right) \le n\le \frac{4B^2}{A^2}\ln\left(\frac{8\pi B^2}{3\sqrt3A^2}\right)$$
