English
Related papers

Related papers: Covering integers by $x^2 + dy^2$

200 papers

Let $ \{L_n\}_{n\ge 0} $ be the sequence of Lucas numbers given by $ L_0=2, ~ L_1=1 $ and $ L_{n+2}=L_{n+1}+L_n $ for all $ n\ge 0 $. In the first paper, for an integer $d\geq 2$ which is square-free, we show that there is at most one value…

Number Theory · Mathematics 2019-08-09 Mahadi Ddamulira

In this paper we study the problem -\Delta u =\left(\frac{2+\alpha}{2}\right)^2\abs{x}^{\alpha}f(\lambda,u), & \hbox{in}B_1 \\ u > 0, & \hbox{in}B_1 u = 0, & \hbox{on} \partial B_1 where $B_1$ is the unit ball of $\R^2$, $f$ is a smooth…

Analysis of PDEs · Mathematics 2015-03-27 Francesca Gladiali , Massimo Grossi , Sérgio Neves

Motivated by the problem of filtering candidate pairs in inner product similarity joins we study the following inner product estimation problem: Given parameters $d\in {\bf N}$, $\alpha>\beta\geq 0$ and unit vectors $x,y\in {\bf R}^{d}$…

Data Structures and Algorithms · Computer Science 2020-01-14 Rasmus Pagh , Johan Sivertsen

Motivated by Euler's observation that the polynomial $x^{2} + x + 41$ takes on prime values for $0 \leq x \leq 39$, we search for large values of $x$ for which $N = x^{2} + x + 41$ is prime. To apply classical primality proving results…

Number Theory · Mathematics 2012-08-01 Justin DeBenedetto , Jeremy Rouse

We present several new results involving $\Delta(x+U)-\Delta(x)$, where $U = o(x)$ and $$ \Delta(x):=\sum_{n\le x}d(n)-x\log x-(2\gamma-1)x $$ is the error term in the classical Dirichlet divisor problem.

Number Theory · Mathematics 2012-09-06 Aleksandar Ivic , Wenguang Zhai

We study asymptotical expansion as $\nu\to0$ for integrals over ${ \mathbb{R} }^{2d}=\{(x,y)\}$ of quotients of the form $F(x,y) \cos(\lambda x\cdot y) \big/ \big( (x\cdot y)^2+\nu^2\big)$, where $\lambda\ge 0$ and $F$ decays at infinity…

Mathematical Physics · Physics 2018-03-20 Sergei Kuksin

An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n\geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n \geq1}$ is uniformly distributed modulo one for…

Number Theory · Mathematics 2015-07-24 Christoph Aistleitner , Gerhard Larcher

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

Number Theory · Mathematics 2024-09-20 Ali Alsetri , Xuancheng Shao

We consider some families of binary binomial forms $aX^d+bY^d$, with $a$ and $b$ integers. Under suitable assumptions, we prove that every rational integer $m$ with $|m|\ge 2$ is only represented by a finite number of the forms of this…

Number Theory · Mathematics 2023-06-06 Étienne Fouvry , Michel Waldschmidt

In this paper, we study the existence and multiplicity of solutions for the following fractional problem involving the Hardy potential and concave-convex nonlinearities: $$({-}{ \Delta})^{\frac{\alpha}{2}}u- \gamma \frac{u}{|x|^{\alpha}}=…

Analysis of PDEs · Mathematics 2020-02-25 Shaya Shakerian

Let $(s_2(n))_{n=0}^\infty$ denote Stern's diatomic sequence. For $n\geq 2$, we may view $s_2(n)$ as the number of partitions of $n-1$ into powers of $2$ with each part occurring at most twice. More generally, for integers $b,n\geq 2$, let…

Combinatorics · Mathematics 2015-06-26 Colin Defant

In this paper, we consider the semilinear equation involving the fractional Laplacian in the Euclidian space $\mathbb{R}^n$: \begin{equation} (-\Delta)^{\alpha/2} u(x) = f(x_n) \,u^p(x), \quad x \in \mathbb{R}^n \label{n26} \end{equation}…

Analysis of PDEs · Mathematics 2015-03-10 Yan Li

Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…

Number Theory · Mathematics 2010-11-19 Andreas Weingartner

In this paper, we show that the equation $\varphi(|x^{m}-y^{m}|)=|x^{n}-y^{n}|$ has no nontrivial solutions in integers $x,y,m,n$ with $xy\neq0, m>0, n>0$ except for the solutions $(x,y,m,n)=((2^{t-1}\pm1),-(2^{t-1}\mp1),2,1),…

Number Theory · Mathematics 2020-01-24 Hairong Bai

We study the distribution of normalized spacings between the fractional parts of an^2, n=1,2,.... We conjecture that if a is "badly approximable" by rationals, then the sequence of fractional parts has Poisson spacings, and give a number of…

Number Theory · Mathematics 2009-10-31 Zeev Rudnick , Peter Sarnak , Alexandru Zaharescu

We determine all integers $n$ such that $n^2$ has at most three base-$q$ digits for $q \in \{2, 3, 4, 5, 8, 16 \}$. More generally, we show that all solutions to equations of the shape $$ Y^2 = t^2 + M \cdot q^m + N \cdot q^n, $$ where $q$…

Number Theory · Mathematics 2016-11-01 Michael A. Bennett , Adrian-Maria Scheerer

In the range $\alpha$-majority query problem, we are given a sequence $S[1..n]$ and a fixed threshold $\alpha \in (0, 1)$, and are asked to preprocess $S$ such that, given a query range $[i..j]$, we can efficiently report the symbols that…

Data Structures and Algorithms · Computer Science 2018-05-24 Travis Gagie , Meng He , Gonzalo Navarro

In this paper, we are interested in the nonlinear Schr\"odinger problem $-\Delta u + Vu = \abs{u}^{p-2}u$ submitted to the Dirichlet boundary conditions. We consider $p>2$ and we are working with an open bounded domain $\Omega\subset\IR^N$…

Analysis of PDEs · Mathematics 2012-12-21 Christopher Grumiau

Let $\beta>1$ be fixed. We consider the $(\frak{b, d})$ numeration system, where the base ${\frak b}=(b_k)_{k\geq 0}$ is a sequence of positive real numbers satisfying $\lim_{k\rightarrow \infty}b_{k+1}/b_k=\beta$, and the set of digits…

Number Theory · Mathematics 2023-05-02 Nian Hong Zhou

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…

Logic in Computer Science · Computer Science 2015-09-22 John Cowles , Ruben Gamboa