English
Related papers

Related papers: Generalizing Giuga's conjecture

200 papers

This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers $n,k$ and $p_1\le p_2\le \cdots\le p_k$ such that $p_1+\cdots+p_k=n$ and $k$ divides $\sum_{i=1}^ni$, we study…

Combinatorics · Mathematics 2024-01-03 Ehab Ebrahem , Shlomo Hoory , Dani Kotlar

The 1-3-5 conjecture of Z.-W. Sun states that any $n\in\mathbb N=\{0,1,2,\ldots\}$ can be written as $x^2+y^2+z^2+w^2$ with $w,x,y,z\in\mathbb N$ such that $x+3y+5z$ is a square. In this paper, via the theory of ternary quadratic forms and…

Number Theory · Mathematics 2020-03-09 Hai-Liang Wu , Zhi-Wei Sun

In this paper we study the sum $$\sum_{j_1+j_2+...+j_d=n}\prod_{i=1}^d F_{k\cdot j_i},$$ where $d\geq2$ and $k\geq1$.

Combinatorics · Mathematics 2007-05-23 Toufik Mansour

We mainly introduce two new kinds of numbers given by $$R_n=\sum_{k=0}^n\binom nk\binom{n+k}k\frac1{2k-1}\quad\ (n=0,1,2,...)$$ and $$S_n=\sum_{k=0}^n\binom nk^2\binom{2k}k(2k+1)\quad\ (n=0,1,2,...).$$ We find that such numbers have many…

Number Theory · Mathematics 2018-11-13 Zhi-Wei Sun

Hasanalizade [1] studied Deaconescu's conjecture for positive composite integer $n$. A positive composite integer $n\geq4$ is said to be a Deaconescu number if $S_2(n)\mid \phi(n)-1$. In this paper, we improve Hasanalizade's result by…

General Mathematics · Mathematics 2025-07-08 Sagar Mandal

Nagata has conjectured that the following statement (N_r) holds for all $r\geq 10$: (N_r) if $P_1,...P_r \in {\mathbb P}^2$ are generic points then any plane curve $C$ satisfies $\sum_1^r mult_{P_i}(C)\leq \sqrt{r} deg(C)$. Nagata proved…

Algebraic Geometry · Mathematics 2013-05-09 Ziv Ran

In the present paper we obtain several new results related to the problem of upper bound estimates for the number of solutions of the congruence $$ x^{x}\equiv \lambda\pmod p;\quad x\in \mathbb{N},\quad x\le p-1, $$ where $p$ is a large…

Number Theory · Mathematics 2015-03-11 Javier Cilleruelo , Moubariz Z. Garaev

In this paper, by constructing some identities, we prove some $q$-analogues of some congruences. For example, for any odd integer $n>1$, we show that \begin{gather*} \sum_{k=0}^{n-1} \frac{(q^{-1};q^2)_k}{(q;q)_k} q^k \equiv (-1)^{(n+1)/2}…

Number Theory · Mathematics 2020-03-25 Chen Wang , He-Xia Ni

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} Z(p^{r})\equiv-2p^{r-1}B_{p-3} ~(\bmod ~ p^{r}), \end{equation*} where $…

Number Theory · Mathematics 2016-11-29 Tianxin Cai , Zhongyan Shen , Lirui Jia

In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…

Number Theory · Mathematics 2024-06-14 Joel E. Cohen

Z.-W. Sun introduced three kinds of numbers: \begin{align*}S_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1),\qquad s_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}\frac{1}{2k-1}, \end{align*} and $S_n^{+}=\sum_{k=0}^{n}{n\choose…

Number Theory · Mathematics 2014-12-18 Victor J. W. Guo , Ji-Cai Liu

We prove the congruence $\sum_{1 \leq k < \sqrt{N}} \sigma_0 (N - k^2) \equiv 0 \pmod 4$, where $\sigma_0(m)$ denotes the number of positive divisors of $m$, for $N = An + B$ with $(A,B) \in \{ (16,14),$ $(36,30),$ $(72,42),$ $(196,70),$…

We show that for any prime prime $p\not=2$ $$\sum_{k=1}^{p-1} {(-1)^k\over k}{-{1\over 2} \choose k} \equiv -\sum_{k=1}^{(p-1)/2}{1\over k} \pmod{p^3}$$ by expressing the l.h.s. as a combination of alternating multiple harmonic sums.

Number Theory · Mathematics 2009-12-25 Roberto Tauraso

Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, Lehmer's generalized Euler numbers are studied to give certain…

Number Theory · Mathematics 2025-01-03 Takao Komatsu , Guo-Dong Liu

We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3]…

Combinatorics · Mathematics 2019-02-11 Ramin Naimi , Eric Sundberg

A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…

Number Theory · Mathematics 2015-07-02 József Vass

In this paper we study combinatorial aspects of permutations of $\{1,\ldots,n\}$ and related topics. In particular, we prove that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$)…

Combinatorics · Mathematics 2021-03-25 Zhi-Wei Sun

In $1984$, Andrews introduced the family of partition functions $c\phi_k(n)$, which enumerate generalized Frobenius partitions of $n$ with $k$ colors. In $2016$, Gu, Wang, and Xia established several congruences for $c\phi_6(n)$ and…

Combinatorics · Mathematics 2026-04-07 Dandan Chen , Siyu Yin

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Number Theory · Mathematics 2009-11-06 Roberto Tauraso

For a given real number $a$ we define the sequence $\{E_{n,a}\}$ by $E_{0,a}=1$ and $E_{n,a}=-a\sum_{k=1}^{[n/2]} \binom n{2k}E_{n-2k,a}$ $(n\ge 1)$, where $[x]$ is the greatest integer not exceeding $x$. Since $E_{n,1}=E_n$ is the n-th…

Number Theory · Mathematics 2013-07-30 Zhi-Hong Sun , Hai-Yan Wang
‹ Prev 1 8 9 10 Next ›