Please consider reopening How to prove that $\lim_{p\rightarrow 0+} \|x\|_p=|\text{supp}\left(x\right)|$?
The post is edited and the context is quite clear as OP mentioned in a comment.
@ArcticChar FYI, this Meta answer explains that deleting a question requires an extra vote for every 20 score that the question & top-voted answer has, up to a total maximum of 10 delete votes. With your particular question, the score of it & the top-voted answer is currently 295, so the 10 vote maximum applies to it.
@SouravGhosh In my opinion? Probably not. But I think that the more salient issue is that it is not a question about mathematics, per the narrow scope of the help center. It seems off-topic, whether or not it is of sufficient quality.
In many sources there are notes that Conway proved that a natural generalization of the Collatz problem is algorithmically undecidable. Let's look at Wikipedia:
Specifically, he considered functions of the form:
$g(n) = a_{i}n+b_{i}$, where $n \equiv i \pmod{P} $
and $a_{0},b_{0},a_{P-1},b_{P-1}...
Please consider reopening How to prove that $\lim_{p\rightarrow 0+} \|x\|_p=|\text{supp}\left(x\right)|$?
The post is edited and the context is quite clear as OP mentioned in a comment.
Could someone please tell me what’s wrong with this proof? Thanks
https://hal.archives-ouvertes.fr/hal-01900627/document#page316
