Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 167 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 425 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

The size of coefficients of certain polynomials related to the Goldbach conjecture (1008.1968v1)

Published 11 Aug 2010 in math.NT

Abstract: Recent work of Borwein, Choi, and the second author examined a collection of polynomials closely related to the Goldbach conjecture: the polynomial $F_N$ is divisible by the $N$th cyclotomic polynomial if and only if there is no representation of $N$ as the sum of two odd primes. The coefficients of these polynomials stabilize, as $N$ grows, to a fixed sequence $a(m)$; they derived upper and lower bounds for $a(m)$, and an asymptotic formula for the summatory function $A(M)$ of the sequence, both under the assumption of a famous conjecture of Hardy and Littlewood. In this article we improve these results: we obtain an asymptotic formula for $a(m)$ under the same assumption, and we establish the asymptotic formula for $A(M)$ unconditionally.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.