For a fair lottery game where the odds of $1$ ticket winning are $1$ in $p$, where you can spend a total of $K$ dollars, and where you will spread your ticket purchases equally among $n$ draws, prove that the odds of winning at least once decrease as $n$ increases.
An online "discussion" I'm having about the relative merits (such as they are) of different strategies of playing the lottery. With a fixed amount of money to spend on lottery tickets, he claims that it's better to spread your ticket purchases out over multiple draws, while I say it's better to spend all the money on unique tickets for one draw.
I can show that I'm correct using absolute numbers, but I'm trying to prove a general case.
$$p \ge K \ge n \ge 1$$
The odds of losing every time (never winning) are given by: $${\left(p-\frac K n\over p\right)}^n$$
I can throw "actual" numbers in there for p, K, and n and show that playing \$100 all at once is better than playing \$10 ten times or \$1 one hundred times.
I want to show the general case. That is, I want to show that for any given p and K, the odds of losing every time: $${\left(p-\frac K n\over p\right)}^n$$ increase as n increases from 1 to K. I started with the presumption: $${\left(p-\frac K {n+1}\right)^{n+1} \over {p^{n+1}}} > { \left(p-\frac K {n}\right)^{n} \over {p^n}}$$ but college math was a long time ago, and I'm stuck at this point (I've probably gone off in the wrong direction): $${\left(p-\frac K {n+1}\right)^{n+1} \over \left(p-\frac K {n}\right)^{n}} > p$$
Any pointers on how I can "simplify" that expression or otherwise continue with a proof?