Timeline for How to prove a result related to prime number theorem in research paper of Rivoal and Zudilin
Current License: CC BY-SA 4.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 26, 2022 at 4:40 | comment | added | Arnold | @YemonChoi No. I am not talking about that comment. The comment which I asked you to delete has been deleted by you or the moderators since I also flagged that comment. It's nothing personal. | |
| Apr 26, 2022 at 1:04 | comment | added | Yemon Choi | @Arnold are you referring to my comment asking why you have bumped the question to the top page through editing? I don't think that is an unkind comment; I think it is a reasonable question, given that you already accepted an answer to this question more than a year ago. | |
| Apr 25, 2022 at 12:42 | comment | added | Arnold | @YemonChoi Your comment is unkind. I request you to delete it. Can you please do that? | |
| Sep 8, 2020 at 12:56 | vote | accept | Arnold | ||
| May 8, 2020 at 21:32 | comment | added | GH from MO | @DxdxDxdx: I don't have time for this right now. Also, it is not too much fun to help students understand a particular line from a paper that is not close to my research. I think your best shot is to contact the authors. As I said, they are mathematicians just like me, but they have the advantage that they wrote the paper, and you write a thesis about their work. So don't be shy, just drop them an email! | |
| May 8, 2020 at 11:24 | comment | added | GH from MO | @DxdxDxdx: I take back "Please restrict to one question per post". Perhaps you can also discuss this topic with friends/classmates. You can also contact the authors of the paper, they are mathematicians just like those who respond here. They will be delighted to hear you write a thesis based on their work. | |
| May 7, 2020 at 18:56 | comment | added | GH from MO | @DxdxDxdx: Please restrict to one question per post. BTW if your professor has abandoned you, then you might as well switch to a different topic and work on it on your own. Or find another professor. | |
| May 3, 2020 at 7:43 | vote | accept | Arnold | ||
| May 4, 2020 at 4:06 | |||||
| Apr 16, 2020 at 21:01 | comment | added | Greg Martin | Check out the definition of $\rho_0$ ... on an interval of the form $[\frac k6,\frac{k+1}6)$, how many different values does $\rho_0$ take? (This, in fact, is the motivation for that specific splitting-up choice.) | |
| Apr 16, 2020 at 20:19 | vote | accept | Arnold | ||
| Apr 16, 2020 at 20:20 | |||||
| Apr 16, 2020 at 20:11 | comment | added | Arnold | thanks!! Now that question is clear. But I have one question still if you don't mind, in 3 rd = how in RHS of = you Put $\rho_0(n/p) $ out of summation by putting$\rho_0(k/6) $ . I can get only up to k+1/6 > n/p $\geq$ k/6 . I am sorry but I can't get it. | |
| Apr 16, 2020 at 15:32 | comment | added | Greg Martin | We're just splitting up the range of summation into intervals on which the function is simpler. A strong analogy would be the computation $$\int_0^N \lfloor x\rfloor^2\,dx = \sum_{k=0}^{N-1} \int_k^{k+1} \lfloor x\rfloor^2\,dx = \sum_{k=0}^{N-1} k^2 \int_k^{k+1} 1\,dx.$$ | |
| Apr 16, 2020 at 15:30 | comment | added | Greg Martin | On the first line, every prime between $2\sqrt n$ and $n$ appears exactly once, and smaller or larger primes don't appear at all. On the second line, do any primes smaller than $2\sqrt n$ or larger than $n$ appear? Given a prime $p$ between $2\sqrt n$ and $n$, for how many values of $k$ will $p$ appear in the inner sum? | |
| Mar 20, 2020 at 11:54 | comment | added | Arnold | how did you deduced that p lies between 6n/k+1 and 6n/k ? I am not able to think about it. Can you please tell. | |
| Mar 20, 2020 at 7:33 | comment | added | Greg Martin | There was a typo (now fixed). We're just splitting up the interval of summation from the first line into $3\sqrt n-1$ consecutive intervals of summation. | |
| Mar 20, 2020 at 7:33 | history | edited | Greg Martin | CC BY-SA 4.0 |
added 2 characters in body
|
| Mar 20, 2020 at 5:36 | comment | added | Arnold | in the fifth line of your answer how did you change $\sum_{2√n<p$\leq$n$ = $\sum_{k=6}^{3√n-1}$ $\sum_{6n/(k+1) p$\leq$6n/k) . Can you please elaborate why it is right? | |
| Mar 9, 2020 at 17:35 | history | answered | Greg Martin | CC BY-SA 4.0 |