Is it possible to reach a score of 50,000 in the game 2048 with only having a highest tile of 512(Only one 512 was present) and one 256 tile and other small numbered tiles such as 2,4,8,16,...,64.
Because my friend has done so in her phone and I am quite skeptical about it so I decided to ask.
Please do show a mathematical explanation instead of giving a direct answer
As far as I can tell, you get $n$ points for forming an $2^n$-tile (ie. $32$ points for forming a tile with $32$ on it, etc). But that doesn't mean that if you have a $2^n$-tile, you'll have a score of $2^n$. That's forgetting the amount of points you got from all the intermediate tiles you would have had to form to get that tile.
If you have a $2^n$ tile, you get $2^n$ score from that tile. But that tile was formed from two $2^{n-1}$ tiles, which would have been formed from four $2^{n-2}$ tiles, and so on. So if you see a $2^n$ tiles on the board, the total score from it and everything that went into making it is at most:
$$2^n+2\cdot2^{n-1}+2^22^{n-2}+...=\sum_{k=0}^{n-2}2^{n-k}2^k=(n-1)2^n$$
I'm summing up to $n-2$ because I'm assuming the best-case scenario where all the basic tiles (given to you by the game) were $2$s, which will maximize your score.
So the score for a $512=2^9$ is at most $8\cdot512=4096$. In the best case scenario where you end with one $512$, one $256$, and the other $14$ tiles $128$s, your score would be $16640$. So $50$ thousand certainly seems unlikely, unless there's some aspect of the scoring that I didn't take into account.