88 reputation
7
bio website
location
age
visits member for 2 years, 6 months
seen Sep 10 at 19:23

Jul
12
awarded  Curious
Jun
8
accepted effective way to get the integer sequence A181392 from oeis
May
16
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?
May
14
revised effective way to get the integer sequence A181392 from oeis
correct link
May
14
comment effective way to get the integer sequence A181392 from oeis
this was my program which use a simple bruteforce checking all squares.
May
14
asked effective way to get the integer sequence A181392 from oeis
Jun
29
awarded  Editor
Jun
29
comment Gauss-Lucas Theorem (roots of derivatives)
sorry. i corrected my mistake.
Jun
29
revised Gauss-Lucas Theorem (roots of derivatives)
added 7 characters in body
Jun
29
asked Gauss-Lucas Theorem (roots of derivatives)
Jun
18
awarded  Analytical
Jun
18
awarded  Commentator
Jun
18
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.
Jun
18
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.
Jun
18
accepted How to prove that $\operatorname{lcm}\{1,\ldots,n\}\geq (\sqrt{n})^{\pi(n)}$?
Jun
18
asked How to prove that $\operatorname{lcm}\{1,\ldots,n\}\geq (\sqrt{n})^{\pi(n)}$?
May
16
accepted Proving $2^{\varphi(n)}\ge n$
May
8
asked Proving $2^{\varphi(n)}\ge n$
May
5
awarded  Supporter
May
5
accepted Value $\Phi_n(1)$ of the cyclotomic polynomial at x=1