English
Related papers

Related papers: On Integer Sequences Associated To Two Distinct Su…

200 papers

For each 1 < p < infinity, there exists a positive constant c_p, depending only on p, such that the following holds. Let (d_k), (e_k) be real-valued martingale difference sequences. If for for all bounded nonnegative predictable sequences…

Probability · Mathematics 2007-05-23 Stephen Montgomery-Smith , Shih-Chi Shen

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

Number Theory · Mathematics 2024-06-11 Michael Hellus , Anton Rechenauer , Rolf Waldi

We determine all pairs of positive integers $(a,b)$ such that $a+b$ and $a \times b$ have the same decimal digits in reverse order: \[ (2,2), (9,9), (3,24), (2,47), (2,497), (2,4997), (2,49997), \ldots \] We use deterministic finite…

Number Theory · Mathematics 2021-12-13 Xander Faber , Jon Grantham

The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…

Statistical Mechanics · Physics 2007-05-23 Pradeep Kumar , Plamen Ch. Ivanov , H. Eugene Stanley

In this paper, we prove the finiteness of the number of integer solutions of the decomposable form inequalities. We also study the number of integer solutions of a sequence of decomposable form inequalities.

Number Theory · Mathematics 2007-05-23 Kalman Gyory , Min Ru

The Ulam sequence is given by $a_1 =1, a_2 = 2$, and then, for $n \geq 3$, the element $a_n$ is defined as the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives the sequence $1, 2,…

Combinatorics · Mathematics 2018-08-28 Noah Kravitz , Stefan Steinerberger

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

Combinatorics · Mathematics 2010-04-13 Timothy D. LeSaulnier , Sujith Vijay

We show that for any polynomial $f$ from the integers to the integers, with positive leading coefficient and irreducible over the rationals, if $x$ is large enough then there is a string of $(\log x)(\log\log x)^{1/835}$ consecutive…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Mikhail R. Gabdullin

This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…

Number Theory · Mathematics 2014-03-20 Brandon Avila , Tanya Khovanova

We show that sequences of positive integers whose ratios $a_n^2/a_{n+1}$ lie within a specific range are almost uniquely determined by their reciprocal sums. For instance, the Sylvester sequence is uniquely characterized as the only…

Number Theory · Mathematics 2025-04-09 Junnosuke Koizumi

For a fixed integer $k$, we define a sequence $A_k=(a_k(n))_{n\geq0}$ and a corresponding sparse subsequence $S_k$ using the cardinality of the $n$-th symmetric power of the set $\{1,2,\ldots, k\}$. For $k\in\{2,\dots,8\}$, we find…

Combinatorics · Mathematics 2024-07-23 Po-Yi Huang , Wen-Fong Ke

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

Combinatorics · Mathematics 2007-05-23 E. Rodney Canfield , Herbert S. Wilf

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is a multiple of 4.

Number Theory · Mathematics 2009-03-27 Kent D. Boklan , Noam D. Elkies

Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…

Combinatorics · Mathematics 2007-05-23 Miklos Bona , Bruce Sagan , Vincent Vatter

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

Combinatorics · Mathematics 2021-08-31 Jakub Konieczny

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

We have found maximum possible runs of consecutive positive integers each having exactly $k$ divisors for some fixed values of $k$. In addition, we exhibit the run of 10 consecutive positive integers each having exactly 12 divisors and two…

Number Theory · Mathematics 2015-10-27 Vladimir A. Letsko

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

Number Theory · Mathematics 2026-02-26 Artyom Radomskii

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

Combinatorics · Mathematics 2018-12-27 Ishay Haviv

By the theory of elliptic curves, we study the integers representable as the product of the sum of four integers with the sum of their reciprocals and give a sufficient condition for the integers with a positive representation.

Number Theory · Mathematics 2016-08-12 Yong Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›