Timeline for Using Vinogradov's theorem for finding prime solutions to a linear equation (an exercise from Vaughan's book)
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2012 at 15:56 | comment | added | Eugen Keil | I think I got it correct. It is the number of solutions to $b_im = b_in$ for $n,m \leq N$, which is $N$ (if $b_i \neq 0$). The maximum is taken over $i = 1,2,3$, not over $y$. This might have confused you. | |
| Jan 28, 2012 at 11:45 | comment | added | Tal H | Thank you very much. Perhaps I'm wrong here, but by Parseval's identity we get $$\int_{-\frac{1}{2}}^{\frac{1}{2}}\text {max}\left(|u_{i}\left(y\right)|^{2}\right)dy\leq N^{2}$$ Don't we? I mean, with $N^2$ instead of $N$... | |
| Jan 26, 2012 at 10:03 | history | answered | Eugen Keil | CC BY-SA 3.0 |