Every integer can be written as a square plus a squarefree
From MaRDI portal
Publication:2674686
Abstract: In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result is deeply related with the divisor function. In the course of our study we get an independent result about it. Concretely we are able to deduce a new upper bound for the divisor function valid for any integer and fully explicit.
Recommendations
- scientific article; zbMATH DE number 5119117
- scientific article; zbMATH DE number 221375
- On the sum of a square and a square of a prime.
- On the representation of a large integer as the sum of a prime and a square-free number with at most three prime divisors
- scientific article; zbMATH DE number 5669841
Cites work
- scientific article; zbMATH DE number 5149291 (Why is no real title available?)
- scientific article; zbMATH DE number 3000575 (Why is no real title available?)
- scientific article; zbMATH DE number 1872954 (Why is no real title available?)
- A Theorem Involving Squarefree Numbers
- An Asymptotic Formula in the Theory of Numbers
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Approximate formulas for some functions of prime numbers
- Generalization of a problem of Evelyn-Linfoot and Page in additive number theory
- Majorations Explicites Pour le Nombre de Diviseurs de N
- New upper bounds for the number of divisors function
- On the Representations of a Number as the Sum of Two Numbers not Divisible by k -th Powers
- On the Representations of a Number as the Sum of a Prime and a Quadratfrei Number
Cited in
(3)
This page was built for publication: Every integer can be written as a square plus a squarefree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674686)