# Explicit upper bound for the average number of divisors of irreducible   quadratic polynomials

**Authors:** Kostadinka Lapkova

arXiv: 1704.02498 · 2017-09-13

## TL;DR

This paper derives an explicit upper bound for the average number of divisors of quadratic polynomials and applies it to improve bounds on certain Diophantine quadruples.

## Contribution

It provides a new explicit upper bound for the divisor sum of quadratic polynomials and applies this to enhance bounds on D(-1)-quadruples.

## Key findings

- Established an asymptotic formula for the divisor sum
- Provided an explicit upper bound matching the main term
- Improved the maximal possible number of D(-1)-quadruples

## Abstract

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main term. As an application we give an improvement of the maximal possible number of $D(-1)$-quadruples.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1704.02498/full.md

## References

25 references — full list in the complete paper: https://tomesphere.com/paper/1704.02498/full.md

---
Source: https://tomesphere.com/paper/1704.02498