Paolo Leonetti
Reputation
2,609
Next privilege 3,000 Rep.
 Sep 30 revised A monotone subadditive non-atomic $f$ on the power of $\bf N$ hasa partition $A,B$ s.t. $f(A),f(B) \in (0,1)$? deleted 21 characters in body; edited title Sep 30 asked A monotone subadditive non-atomic $f$ on the power of $\bf N$ hasa partition $A,B$ s.t. $f(A),f(B) \in (0,1)$? Sep 28 reviewed Reject Understanding Erdös Discrepancy Conjecture $\left| \sum_{i=1}^k x_{i\cdot d} \right| > C$ for random series of $-1$ and $1$ Sep 27 reviewed Approve How to show that $\frac{3}{2}x-6-\frac{1}{2}\sin(2x)$ has one unique real root? Sep 27 reviewed Reject A trick for calculating $n^6$ that I don't understand Sep 27 reviewed Approve Simple first order differential equation Sep 27 comment $a^m+k=b^n$ Finite or infinite solutions? A related question here math.stackexchange.com/questions/1452855/… Sep 27 revised $2n^2-\lfloor m^b\rfloor=k$ has only finitely many integer solutions added 348 characters in body; edited title Sep 27 comment $2n^2-\lfloor m^b\rfloor=k$ has only finitely many integer solutions I was just trying to construct an example related to this MO question mathoverflow.net/questions/219274/… . Anyway, it recalled me a well-known problem related to Mihailescu theorem, that's why I posed it here :) Sep 26 asked $2n^2-\lfloor m^b\rfloor=k$ has only finitely many integer solutions Sep 12 comment Prove that any integer that is both square and cube is congruent modulo 36 to 0,1,9,28 I removed my answer, I had to have a coffee instead :P Sep 12 awarded Enthusiast Sep 10 comment Prove that if $\epsilon > 0$ is given, then $\frac{n}{n+2}$ ${\approx_\epsilon}$ 1, for $n$ $\gg$1. No worry about the vote, at least we agreed on the point ;) Sep 10 comment Prove that if $\epsilon > 0$ is given, then $\frac{n}{n+2}$ ${\approx_\epsilon}$ 1, for $n$ $\gg$1. It trivially implies that $|\frac{n}{n+2}-1|<\frac{2}{n}$, which goes to $0$. Sep 10 answered Prove that if $\epsilon > 0$ is given, then $\frac{n}{n+2}$ ${\approx_\epsilon}$ 1, for $n$ $\gg$1. Sep 9 comment Existence of a monotone subadditive function with a jump on its values It is the same problem, in another form: I agree that by construction $f(B)<1$, but to prove that $\frac{n}{2m}f(A)>f(A)$ you woud need $n>2m$, which is not true.. Sep 9 comment Existence of a monotone subadditive function with a jump on its values Mmh you assume $f(A)<\frac{m}{n}<1$, so that \$m