English
Related papers

Related papers: On a conjecture of Sun

200 papers

The 3x+1 semigroup is the multiplicative semigroup generated by the rational numbers of form (2k+1)/(3k+2) for non-negative k, together with 2. This semigroup encodes backward iteration under the 3x+1 map, and the 3x+1 conjecture implies…

Number Theory · Mathematics 2007-05-23 David Applegate , Jeffrey C. Lagarias

We confirm a conjectural supercongruence involving Catalan numbers, which is one of the 100 selected open conjectures on congruences of Sun. The proof makes use of hypergeometric series identities and symbolic summation method.

Number Theory · Mathematics 2020-01-14 Ji-Cai Liu

For positive integers $a_1,\ldots,a_r$ with $a_1 \ge 2$, the multiple $t$-value $t(a_1,\ldots,a_r)$ is defined by the series $\sum\limits_{n_1 > \ldots > n_r > 0 \atop n_i \text{ odd}} n_1^{-a_1} \cdots n_r^{-a_r}$. For an integer $k \ge…

Number Theory · Mathematics 2017-12-19 Biswajyoti Saha

Take an odd number x >0. Then 3x+1 is even and one can find an integer k> 0 so that y= 3x+1/2^k is again odd. We get in this way the mapping T, Tx=y. The paper contains two theorems describing statistical properties of T. The first…

Dynamical Systems · Mathematics 2007-05-23 Yakov Sinai

We present some interesting observations on the 3x+1 problem. We propose a new algorithm which eliminates certain steps while we check the action of 3x+1 procedure on a number. Also, we propose a reason why many numbers follow a similar…

General Mathematics · Mathematics 2007-05-23 Dhananjay P. Mehendale

A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…

Logic · Mathematics 2009-05-07 Karim Nour

The Franel numbers are defined by $ f_n=\sum_{k=0}^n {n\choose k}^3. $ Motivated by the recent work of Z.-W. Sun on Franel numbers, we prove that \begin{align*} \sum_{k=0}^{n-1}(3k+1)(-16)^{n-k-1} {2k\choose k} f_k &\equiv…

Number Theory · Mathematics 2014-04-29 Victor J. W. Guo

The numbers $R_n$ and $W_n$ are defined as \begin{align*} R_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{1}{2k-1},\ \text{and}\ W_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{3}{2k-3}. \end{align*} We prove that, for any positive…

Number Theory · Mathematics 2015-01-06 Victor J. W. Guo , Ji-Cai Liu

Let $a,b$ and $n$ be positive integers with $a>b$. In this note, we prove that $$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$ This confirms a recent conjecture of Amdeberhan and Moll.

Number Theory · Mathematics 2015-02-26 Quan-Hui Yang

Let $\zeta(.)$ denote the Riemann zeta function and let $a(.)$ and $A(.)$ respectively denote a multiplicative function and its corresponding summatory function. We consider the correlation $$ \langle a(n)A(n-1) \rangle (T) =…

Number Theory · Mathematics 2026-05-15 Gordon Chavez

I want to show one possibility to proof the Collatz conjecture, also called 3n+1 conjecture, for any natural number N. For this, I limit my analysis on the direct odd follower of every natural odd number and show the connections between the…

General Mathematics · Mathematics 2013-03-14 Carolin Zöbelein

Sun, in 2022, introduced a conjectured evaluation for a series of convergence rate $\frac{1}{2}$ involving harmonic numbers. We prove both this conjecture and a stronger version of this conjecture, using a summation technique based on a…

Number Theory · Mathematics 2023-04-04 John M. Campbell

We study the (variable-length) codes of the form X u {a^n}, where X c a*wa* and |X| = n. We extend various notions and results from factorizations of cyclic groups theory to this type of codes. In particular, when n is the product of at…

Combinatorics · Mathematics 2023-02-01 Christophe Cordero

Let $\tau_k(n)$ be the $k$-th divisor function. In this paper, we derive an asymptotic formula for the sum $$ \sum_{1\leq n_1,n_2, \dots, n_{\ell}\leq X^{\frac{1}{r}} \atop 1\leq n_{\ell+1}\le X^{\frac{1}{s}}}\tau_k(n_1^r+n_2^r+\dots…

Number Theory · Mathematics 2024-08-21 Chenhao Du , Qingfeng Sun

For all positive non-square integer multiplier k, there is an infinity of multiples of triangular numbers which are also triangular numbers. With a simple change of variables, these triangular numbers can be found using solutions of Pell…

Number Theory · Mathematics 2021-04-22 Vladimir Pletser

We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…

Number Theory · Mathematics 2011-06-23 Mohamed El Bachraoui

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

Combinatorics · Mathematics 2017-02-06 Andrei Asinowski , Christian Krattenthaler , Toufik Mansour

Many $\mathbb{Q}$-linear relations exist between multiple zeta values, the most interesting of which are various weighted sum formulas. In this paper, we generalized these to Euler sums and some other variants of multiple zeta values by…

Number Theory · Mathematics 2024-10-04 Sasha Berger , Aarav Chandra , Jasper Jain , Daniel Xu , Ce Xu , J. Zhao

We prove that a positive integer not of the form, 4^{k}(8m+7) can be expressible as a sum of three or fewer squares by using some results of Kane and Sun on mixed sums of squares and triangular numbers.

Number Theory · Mathematics 2008-12-05 Agustin Moreno

We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.

Combinatorics · Mathematics 2011-11-10 Maxim Krikun