相关论文: Extensions of Stern's congruence for Euler numbers

Let $p>3$ be a prime, and let $a$ be a rational p-adic integer with $a\not\equiv 0\pmod p$. In this paper we establish congruences for $$\sum_{k=1}^{(p-1)/2}\frac{\binom ak\binom{-1-a}k}k, \quad\sum_{k=0}^{(p-1)/2}k\binom ak\binom{-1-a}k…

For various positive integers $k$, the sums of $k$th powers of the first $n$ positive integers, $S_k(n+1)=1^k+2^k+...+n^k$, have got to be some of the most popular sums in all of mathematics. In this note we prove that for each $k\ge 2 $$…

The n-th Delannoy number and the n-th Schr\"oder number given by $D_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}$ and $S_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}/(k+1)$ respectively arise naturally from enumerative combinatorics. Let p be an…

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

We present various identities involving the classical Bernoulli and Euler polynomials. Among others, we prove that $$ \sum_{k=0}^{[n/4]}(-1)^k {n\choose 4k}\frac{B_{n-4k}(z) }{2^{6k}} =\frac{1}{2^{n+1}}\sum_{k=0}^{n} (-1)^k…

If the equation of the title has an integer solution with $k\ge2$, then $m>10^{9.3\cdot10^6}$. This was the current best result and proved using a method due to L. Moser (1953). This approach cannot be improved to reach the benchmark…

Let $M(x)$ denote the largest cardinality of a subset of $\{n \in \mathbf{N}: n \leq x\}$ on which the Euler totient function $\varphi(n)$ is non-decreasing. We show that $M(x) = (1+O(\frac{(\log\log x)^5}{\log x})) \pi(x)$ for all $x \geq…

For any positive integers l and m, a set of integers is said to be (weakly) l-sum-free modulo m if it contains no (pairwise distinct) elements $x_1,x_2,...,x_l,y$ satisfying the congruence $x_1+\...+x_l\equiv y\bmod{m}$. It is proved that,…

We present a large number of analytic evaluations of Euler sums, namely sums such as \begin{align} M(m,n_0,n_1,n_2, \ldots, n_t) &= \sum_{k=1}^\infty \frac{H(k)^m}{k^{n_0} (k+1)^{n_1} (k+2)^{n_2} \cdots (k+t)^{n_t}}, \nonumber \end{align}…

The Euler numbers have been widely studied. A signed version of the Euler numbers of even subscript are given by the coefficients of the exponential generating function 1/(1+x^2/2!+x^4/4!+...). Leeming and MacLeod introduced a…

In this paper we deduce some new supercongruences modulo powers of a prime $p>3$. Let $d\in\{0,1,\ldots,(p-1)/2\}$. We show that $$\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k\binom{2k}{k+d}}{8^k}\equiv 0\ (\mbox{mod}\ p)\ \ \ \mbox{if}\ d\equiv…

Let $p,p_1,\ldots,p_m$ be positive integers with $p_1\leq p_2\leq\cdots\leq p_m$ and $x\in [-1,1)$, define the so-called Euler type sums ${S_{{p_1}{p_2} \cdots {p_m},p}}\left( x \right)$, which are the infinite sums whose general term is a…

We prove that for a positive integer a the integer sequence P(n) satisfying for all n, -infty<n<infty, the recurrence P(n)=a+P(n-phi(a)), phi(a) the Euler function, generates in increasing order all integers P(n) coprime to a.The finite…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Using the theory of Stienstra and Beukers, we prove various elementary congruences for the numbers \sum \binom{2i_1}{i_1}^2\binom{2i_2}{i_2}^2...\binom{2i_k}{i_k}^2, where k,n \in N, and the summation is over the integers i_1, i_2, ...i_k…

E26 in the Enestrom index. Translated from the Latin original, "Observationes de theoremate quodam Fermatiano aliisque ad numeros primos spectantibus" (1732). In this paper Euler gives a counterexample to Fermat's claim that all numbers of…

Let $B_{n}(t)$ be a $n$-th Stern polynomial and let $e(n)=\op{deg}B_{n}(t)$ be its degree. In this note we continue our study started in \cite{Ul} of the arithmetic properties of the sequence of Stern polynomials and the sequence…

Let $n=p_1^{\nu_1}... p_r^{\nu_r} >1$ be an integer. An integer $a$ is called regular (mod $n$) if there is an integer $x$ such that $a^2x\equiv a$ (mod $n$). Let $\varrho(n)$ denote the number of regular integers $a$ (mod $n$) such that…

An integer $k$ is called regular (mod $n$) if there exists an integer $x$ such that $k^2x\equiv k$ (mod $n$). This holds true if and only if $k$ possesses a weak order (mod $n$), i.e., there is an integer $m\ge 1$ such that $k^{m+1} \equiv…