Reputation
21,627
Next privilege 25,000 Rep.
Access to site analytics
Badges
4 86 116
Newest
 Nice Answer
Impact
~126k people reached

Aug
12
comment Divisor sums over values of binary forms of primes
You're right; this is what I had in mind. But the range between $x/(\log x)^A$ and $x$ is problematic. But then in your question you state an upper bound for $S(x)$ which is not clear to me -- Brun-Titchmarsh doesn't seem to imply the bound, and one is off by a $\log \log x$ factor I think. (Because B-T would save only a factor of $\log (ex/d)$ and this is problematic for the large $d$.)
Aug
11
comment Divisor sums over values of binary forms of primes
It seems to me that the large sieve could be used to prove such an asymptotic formula, but you'd have to check the details.
Aug
7
reviewed Leave Open Examples of research on how people perceive mathematical objects
Aug
7
reviewed Leave Open Contour plots of Riemann zeta-function
Aug
5
reviewed Close Primes $p$ such that $432 p +1$ is prime
Aug
5
comment Primes $p$ such that $432 p +1$ is prime
This question appears to be off-topic because it is about a well known open problem -- namely, generalized Hardy-Littlewood conjectures.
Aug
5
reviewed Leave Open Squarefree numbers $n$ such that $432n+1$ is also squarefree
Aug
4
reviewed Leave Open Is $x^{n}-x-1$ irreducible?
Aug
1
reviewed Leave Open Circles avoiding rational points of height $\le h$
Jul
29
reviewed Close Default Orientation of Vectors
Jul
26
awarded  Good Answer
Jul
25
reviewed No Action Needed $K$-homology of $BG$
Jul
25
reviewed No Action Needed Visualization of Riemann–Stieltjes Integrals
Jul
25
awarded  Good Answer
Jul
17
comment Lebesgue measure of a set of irrational numbers
See my answer to mathoverflow.net/questions/161441/… which gives a reference to Khinchin's book, and a Theorem of Khinchin that discusses general such problems.
Jul
15
comment Is this weak asymptotic Goldbach's conjecture open?
Montgomery and Vaughan showed that the exceptional set in Goldbach's conjecture contains at most $O(x^{1-\delta})$ elements for some $\delta >0$. See matwbn.icm.edu.pl/ksiazki/aa/aa27/aa27126.pdf .
Jul
13
comment Is formula valid for relating $\pi$ with ALL of its OEIS A002485(n)/A002486(n) convergents?
Also posted at MSE: math.stackexchange.com/questions/860499/…
Jul
12
comment An upper bound on families of subsets with a small pairwise intersection
Actually, as noted in my earlier answer the upper bound $\binom{n}{s+1}/\binom{r}{s+1}$ is easy to obtain. I don't know if this is enough, or if you're looking for stronger bounds. Non-trivial can be vague!
Jul
12
comment An upper bound on families of subsets with a small pairwise intersection
See my answer to this earlier MO question: mathoverflow.net/questions/161159/… . In particular, the paper by Frankl that I linked discusses general such problems, and Theorem 4.3 there (by Deza, Erdos and Frankl) would give non-trivial bounds in your question.
Jul
10
awarded  analytic-number-theory