相关论文: On Euler numbers modulo powers of two
In this paper we give Kummer's original type congruence relation modulo a prime power for the universal Bernoulli numbers. Although the index of the power is half of original congruence, this estimate is best possible.
In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…
This note highlights an interesting connection between Euler sums of even weight and prime numbers.
In this paper we prove some transformation formulae for congruences modulo a prime and deduce some congruences for Domb numbers and Almkvist-Zudilin numbers. We also pose some conjectures on congruences modulo prime powers.
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…
In this brief note, we give two explicit formulas for the Bernoulli Numbers in terms of the Stirling numbers of the second kind, and the Eulerian Numbers. To the best of our knowledge, these formulas are new. We also derive two more…
Recently there has been quite a bit of study carried out related to arithmetic properties of overpartitions into non-multiples of two co-prime integers. The paper [19] by Nadji et al. looked into congruences modulo $3$ and powers of $2$ for…
Let m>=1 be an arbitrary fixed integer and let N_m(x) count the number of odd integers u<=x such that the order of 2 modulo u is not divisible by m. In case m is prime estimates for N_m(x) were given by H. Mueller that were subsequently…
In this article, we introduce congruential Euler numbers, which are a further generalization of generalized Euler numbers. We prove the $p$-adic congruences of congruential Euler numbers, which include answers to a conjecture related to…
We present a proof given by Euler in his paper {\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination of series or a new method of finding the general terms of…
We compute the congruence class modulo 16 of the number of unique path partitions of $n$ (as defined by Olsson), thus generalising previous results by Bessenrodt, Olsson and Sellers [Ann. Combin. 13 (2013), 591-602].
In this article we exhibit new explicit families of congruences for the overpartition function, making effective the existence results given previously by Treneer. We give infinite families of congruences modulo $m$ for $m = 5, 7, 11$, and…
We treat two different equations involving powers of singular moduli. On the one hand, we show that, with two possible (explicitly specified) exceptions, two distinct singular moduli j(\tau),j(\tau') such that the numbers 1, j(\tau)^m and…
The numbers of even and odd permutations with a given ascent number are investigated using an operator that was previously introduced by the author. Their difference is called a signed Eulerian number. By means of the operator the…
In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…
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,…
Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…
In this paper, we investigate two methods to express the natural powers of $2$ as sums over integer partitions. First we consider a formula by N. J. Fine that allows us to express a binomial coefficient in terms of multinomial coefficients…
Using elementary methods, we determine the highest power of 2 dividing a power sum 1^n + 2^n + . . . + m^n, generalizing Lengyel's formula for the case where m is itself a power of 2. An application is a simple proof of Moree's result that,…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…