wieschoo
Reputation
Top tag
Next privilege 100 Rep.
Edit community wikis
 Feb2 comment Gauss-Lucas Theorem (roots of derivatives) I found an interesting paper: arxiv.org/pdf/1405.0689 Jul12 awarded Curious Jun8 accepted effective way to get the integer sequence A181392 from oeis May16 comment effective way to get the integer sequence A181392 from oeis Where exactly do you prune the search space? Hensel lifting lemma states that an odd perfect root must be a square mod 10 (and thus a square mod 2 and a square mod 5). But this only gives a necessary condition what the last three digits have to be? May14 revised effective way to get the integer sequence A181392 from oeis correct link May14 comment effective way to get the integer sequence A181392 from oeis this was my program which use a simple bruteforce checking all squares. May14 asked effective way to get the integer sequence A181392 from oeis Jun29 awarded Editor Jun29 comment Gauss-Lucas Theorem (roots of derivatives) sorry. i corrected my mistake. Jun29 revised Gauss-Lucas Theorem (roots of derivatives) added 7 characters in body Jun29 asked Gauss-Lucas Theorem (roots of derivatives) Jun18 awarded Analytical Jun18 awarded Commentator Jun18 comment How to prove that $\operatorname{lcm}\{1,\ldots,n\}\geq (\sqrt{n})^{\pi(n)}$? I didn't see $\lfloor \log_p(n)\ge \log_p(n)/2$. Now, it is clear. Thank you. Jun18 comment How to prove that $\operatorname{lcm}\{1,\ldots,n\}\geq (\sqrt{n})^{\pi(n)}$? Thank you. I haven't much experience with the $\psi$-function. So I can follow $\psi(n) = \sum_{p\text{ is prime}} \sum_{\overset{k \in \mathbb{Z}^+}{p^k \leq n}} \log_e(p)$. Maybe it is the right time for my to read sth about that. Thank you anyway. Jun18 accepted How to prove that $\operatorname{lcm}\{1,\ldots,n\}\geq (\sqrt{n})^{\pi(n)}$? Jun18 asked How to prove that $\operatorname{lcm}\{1,\ldots,n\}\geq (\sqrt{n})^{\pi(n)}$? May16 accepted Proving $2^{\varphi(n)}\ge n$ May8 asked Proving $2^{\varphi(n)}\ge n$ May5 awarded Supporter