English
Related papers

Related papers: Mahler's $\frac{3}{2}$ problem in $\mathbb{Z}^{+} …

200 papers

In this work we study the existence of positive solution to the fractional quasilinear problem, $$ \left\{ \begin{array}{rcll} (-\Delta )^s u &=&\lambda \dfrac{u}{|x|^{2s}}+ |\nabla u|^{p}+ \mu f &\inn \Omega,\\ u&>&0 & \inn\Omega,\\ u&=&0…

Analysis of PDEs · Mathematics 2020-02-07 Boumediene Abdellaoui , Ireneo Peral , Ana Primo , Fernando Soria

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…

Combinatorics · Mathematics 2013-02-19 Alain Plagne , Anne de Roton

In 1971 Cusick proved that every real number $x\in[0,1]$ can be expressed as a sum of two continued fractions with no partial quotients equal to $1$. In other words, if we define a set $$ S(k):= \{ x\in[0,1] : a_n(x) \geq k \text{ for all }…

Number Theory · Mathematics 2025-06-09 Nikita Shulga

The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…

General Mathematics · Mathematics 2019-10-18 Erhan Tezcan

We use a method, first developed for the Riemann zeta-function by Masser in ["Rational values of the Riemann zeta function", Journ. Num. Th. 131 (2011), 2037-2046], to prove a new zero estimate for polynomials in z and 1/Gamma(z). This…

Number Theory · Mathematics 2013-09-27 Etienne Besson

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

Rings and Algebras · Mathematics 2009-12-08 Marla Slusky

A $P$-polynomial corner, for $P \in \mathbb{Z}[z]$ a polynomial, is a triple of points $(x,y),\; (x+P(z),y),\; (x,y+P(z))$ for $x,y,z \in \mathbb{Z}$. In the case where $P$ has an integer root of multiplicity $1$, we show that if $A…

Combinatorics · Mathematics 2024-09-04 Noah Kravitz , Borys Kuca , James Leng

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…

Number Theory · Mathematics 2023-06-23 Jörg Brüdern , Olivier Robert

Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…

Number Theory · Mathematics 2019-11-13 Kyle Pratt

A number $N$ is a triangular number if it can be written as $N = t(t + 1)/2$ for some nonnegative integer number $t$. A triangular number $N$ is called square if it is a perfect square, that is, $N = d^2$ for some integer number $d$. Square…

Number Theory · Mathematics 2026-02-20 Vladimir Gurvich , Mariya Naumova

For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let $R_{A}(\overline{n})$ denote the number of solutions of…

Number Theory · Mathematics 2020-07-02 Cui-Fang Sun , Meng-Chi Xiong

Erd\H{o}s showed that every set of $n$ positive integers contains a subset of size at least $n/(k+1)$ containing no solutions to $x_1 + \cdots + x_k = y$. We prove that the constant $1/(k+1)$ here is best possible by showing that if $(F_m)$…

Combinatorics · Mathematics 2014-12-17 Sean Eberhard

It is shown that Bernoulli numbers and tangent numbers (the derivatives of the tangent function at zero) can be obtained by means of easily defined triangles of numbers in several ways, some of them very similar to the Catalan triangle and…

Number Theory · Mathematics 2007-05-23 Jose Luis Arregui

Let $n$ be a cubefree natural number and $p\geq 5$ be a prime number. Assume that $n$ is not expressible as a sum of the form $x^3+y^3$, where $x,y\in \mathbb{Q}$. In this note, we study the solutions (or lack thereof) to the equation…

Number Theory · Mathematics 2024-11-22 Anwesh Ray

A recent article of Berndt and Yee found congruences modulo 3^k for certain ratios of Eisenstein series. For all but one of these, we show there are no simple congruences a(pn+c) = 0 modulo p when p>= 13 is prime. This follows from a more…

Number Theory · Mathematics 2009-10-02 Michael Dewar

We show that almost all natural numbers n not divisible by 4, and not congruent to 7 modulo 8, are represented as the sum of three squares, one of which is the square of an integer no larger than (log n)^{1+e} (any e>0). This answers a…

Number Theory · Mathematics 2022-02-14 Trevor D. Wooley

The reduction modulo $p$ of a family of lacunary integer polynomials, associated with the dynamical zeta function $\zeta_{\beta}(z)$ of the $\beta$-shift, for $\beta > 1$ close to one, is investigated. We briefly recall how this family is…

Number Theory · Mathematics 2022-01-11 Denys Dutykh , Jean-Louis Verger-Gaugry

One familiar with the Euler zeta function, which established the remarkable relationship between the prime and composite numbers, might naturally ponder the results of the application of this special function in cases where there is no…

Number Theory · Mathematics 2023-04-12 Michael P. May

For a non-negative integer $m$, let $S(m)$ denote the sum given by $$S(m):=\sum_{n=0}^{m}\frac{(-1)^n(8n+1)}{n!^3}\left(\frac{1}{4}\right)_n^3.$$ Using the powerful WZ-method, for a prime $p\equiv 3$ $($mod $4)$ and an odd integer $r>1$, we…

Number Theory · Mathematics 2024-07-11 Arijit Jana , Gautam Kalita

A primary pseudoperfect number (PPN) is an integer $K > 1$ such that the reciprocals of $K$ and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebraic surfaces, and are related to…

Number Theory · Mathematics 2018-12-18 Jonathan Sondow , Kieren MacMillan