A binary additive equation with prime and square-free number

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Dimitrov, S. I.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912633779650560
author Dimitrov, S. I.
author_facet Dimitrov, S. I.
contents Let $[\, \cdot\,]$ be the floor function. In this paper, we show that when $1<c<\frac{82}{79}$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c]+[m^c]\,, \end{equation*} where $p$ is a prime and $m$ is a square-free.
format Preprint
id arxiv_https___arxiv_org_abs_2401_06190
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A binary additive equation with prime and square-free number
Dimitrov, S. I.
Number Theory
Let $[\, \cdot\,]$ be the floor function. In this paper, we show that when $1<c<\frac{82}{79}$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c]+[m^c]\,, \end{equation*} where $p$ is a prime and $m$ is a square-free.
title A binary additive equation with prime and square-free number
topic Number Theory
url https://arxiv.org/abs/2401.06190