English
Related papers

Related papers: On the Elementary Symmetric Functions of $\{1,1/2,…

200 papers

In 1946, P. Erd\H os and I. Niven proved that there are only finitely many positive integers $n$ for which one or more elementary symmetric functions of $1, 1/2, \ldots , 1/n$ are integers. In this paper we solve this old problem by showing…

Number Theory · Mathematics 2014-09-16 Yong-Gao Chen , Min Tang

Erdos and Niven proved that for any positive integers $m$ and $d$, there are only finitely many positive integers $n$ for which one or more of the elementary symmetric functions of $1/m,1/(m+d), ..., 1/(m+nd)$ are integers. Recently, Chen…

Number Theory · Mathematics 2011-12-06 Chunlin Wang , Shaofang Hong

Erd\"{o}s and Niven proved in 1946 that for any positive integers $m$ and $d$, there are at most finitely many integers $n$ for which at least one of the elementary symmetric functions of $1/m, 1/(m+d), ..., 1/(m+(n-1)d)$ are integers.…

Number Theory · Mathematics 2014-03-20 Yuanyuan Luo , Shaofang Hong , Guoyou Qian , Chunlin Wang

Let $a$ and $b$ be positive integers. In 1946, Erd\H{o}s and Niven proved that there are only finitely many positive integers $n$ for which one or more of the elementary symmetric functions of $1/b, 1/(a+b),..., 1/(an-a+b)$ are integers. In…

Number Theory · Mathematics 2014-03-25 Chunlin Wang , Shaofang Hong

In 2015, S. Hong and C. Wang proved that none of the elementary symmetric functions of $1,1/3,\ldots,1/(2n-1)$ is an integer when $n\geq 2$. In 2017, Kh. Pilehrood, T. Pilehrood and R. Tauraso proved that the multiple harmonic sums…

Number Theory · Mathematics 2022-04-05 Zhonghua Li , Zhenlu Wang

Let $n$ be a positive integer. In 1915, Theisinger proved that if $n\ge 2$, then the $n$-th harmonic sum $\sum_{k=1}^n\frac{1}{k}$ is not an integer. Let $a$ and $b$ be positive integers. In 1923, Nagell extended Theisinger's theorem by…

Number Theory · Mathematics 2018-10-09 Yulu Feng , Shaofang Hong , Xiao Jiang , Qiuyu Yin

It is well known that the harmonic sum $H_n(1)=\sum_{k=1}^n\frac{1}{k}$ is never an integer for $n>1$. In 1946, Erd\H{o}s and Niven proved that the nested multiple harmonic sum $H_n(\{1\}^r)=\sum_{1\le k_1<\dots<k_r\le n}\frac{1}{k_1\cdots…

Number Theory · Mathematics 2016-06-21 Khodabakhsh Hessami Pilehrood , Tatiana Hessami Pilehrood , Roberto Tauraso

In 2008, Cusick {\it et al.} conjectured that certain elementary symmetric Boolean functions of the form $\sigma_{2^{t+1}l-1, 2^t}$ are the only nonlinear balanced ones, where $t$, $l$ are any positive integers, and…

Information Theory · Computer Science 2015-03-20 Wei Su , Xiaohu Tang , Alexander Pott

Let $r\geq3$ and $G$ be an $r$-uniform hypergraph with vertex set $\left\{ 1,\ldots,n\right\} $ and edge set $E$. Let \[ \mu\left( G\right) :=\max {\textstyle\sum\limits_{\left\{ i_{1},\ldots,i_{r}\right\} \in E}} x_{i_{1}}\cdots x_{i_{r}},…

Combinatorics · Mathematics 2018-03-15 V. Nikiforov

For all natural numbers a,b and d > 0, we consider the function f_{a,b,d} which associates n/d to any integer n when it is a multiple of d, and an + b otherwise; in particular f_{3,1,2} is the Collatz function. Coding in base a > 1 with b <…

Formal Languages and Automata Theory · Computer Science 2022-05-30 Didier Caucal , Chloé Rispal

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…

Number Theory · Mathematics 2014-09-16 Yong-Gao Chen , Xiao-Feng Zhou

We construct a symmetric invertible binary pairing function $F(m,n)$ on the set of positive integers with a property of $F(m,n)=F(n,m)$. Then we provide a complete proof of its symmetry and bijectivity, from which the construction of…

Combinatorics · Mathematics 2021-05-25 Jianrui Xie

We show that, for any $r\geq 1$, if $g_1,\ldots,g_r$ are distinct coprime integers, sufficiently large depending only on $r$, then for any $\epsilon>0$ there are infinitely many integers $n$ such that all but $\epsilon \log n$ of the digits…

Number Theory · Mathematics 2025-09-04 Thomas F. Bloom , Ernie Croot

Given $r \in \mathbb{N}$, define the function $S_{r}: \mathbb{N} \rightarrow \mathbb{Q}$ by $S_{r}(n)=\displaystyle \sum_{k=0}^{n} \frac{k}{k+r} \binom{n}{k}$. In $2015$, the second author conjectured that there are infinitely many $r \in…

Number Theory · Mathematics 2019-03-20 Shanta Laishram , Daniel López-Aguayo , Carl Pomerance , Thotsaphon Thongjunthug

It was proven in 1915 by Leopold Theisinger that the $H_n$ harmonic numbers are never integers. In 1996 Conway and Guy have defined the concept of hyperharmonic numbers. The question naturally arises: are there any integer hyperharmonic…

Number Theory · Mathematics 2008-11-04 István Mező

Suppose $ m,n\geq 2 $ are co prime integers. We prove certain new symmetries of the base $ n $ representation of $ 1/m $, and in particular characterize the subgroup generated by $ n $ inside $ (\mathbb{Z}/m\mathbb{Z})^\times $. As an…

Number Theory · Mathematics 2021-07-27 Kalyan Chakraborty , Krishnarjun Krishnamoorthy

In 1956, Je$\acute{s}$manowicz conjectured that, for positive integers $m$ and $n$ with $m>n, \, \gcd(m,\, n)=1$ and $m\not\equiv n\pmod{2}$, the exponential Diophantine equation $(m^2-n^2)^x+(2mn)^y=(m^2+n^2)^z$ has only the positive…

Number Theory · Mathematics 2019-03-04 Qing Han , Pingzhi Yuan

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

Number Theory · Mathematics 2026-01-21 Sándor Z. Kiss , Csaba Sándor , Maciej Zakarczemny

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Number Theory · Mathematics 2026-01-16 Carl Pomerance , Andreas Weingartner

Orthogonal designs and weighing matrices have many applications in areas such as coding theory, cryptography, wireless networking and communication. In this paper, we first show that if positive integer $k$ cannot be written as the sum of…

Combinatorics · Mathematics 2016-02-26 Ebrahim Ghaderpour
‹ Prev 1 2 3 10 Next ›