English
Related papers

Related papers: On Euler numbers modulo powers of two

200 papers

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

Number Theory · Mathematics 2025-06-17 Frits Beukers

We prove a recursive formula for the exterior and symmetric powers of modules for a cyclic 2-group. This makes computation straightforward. Previously, a complete description was only known for cyclic groups of prime order.

Representation Theory · Mathematics 2015-10-09 Frank Himstedt , Peter Symonds

In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

Combinatorics · Mathematics 2020-05-19 Xinhua Xiong , William J. Keith

In the present article, we study Bell based Euler polynomial of order {\alpha} and investigate some useful correlation formula, summation formula and derivative formula. Also, we introduce some relation of string number of the second kind.…

Number Theory · Mathematics 2021-04-20 Nabiullah Khan , Saddam Husain

E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some…

History and Overview · Mathematics 2007-12-04 Leonhard Euler

This paper gives new explicit formulas for sums of powers of integers and their reciprocals.

Combinatorics · Mathematics 2020-06-03 Levent Kargın , Ayhan Dil , Mümün Can

We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.

Logic · Mathematics 2009-05-07 Karim Nour , Christophe Raffalli

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

Combinatorics · Mathematics 2025-07-29 Christian Krattenthaler , Thomas W. Müller

We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…

Classical Analysis and ODEs · Mathematics 2020-04-21 Luca Brandolini , Leonardo Colzani , Sinai Robins , Giancarlo Travaglini

Let $p$ be a large prime number and $g$ be any integer of multiplicative order $T$ modulo $p$. We obtain a new estimate of the double exponential sum $$ S=\sum_{n\in \mathcal{N}}\left|\sum_{m\in \mathcal{M} }e_p(an g^{m})\right|, \quad \gcd…

Number Theory · Mathematics 2018-10-16 M. Z. Garaev

Recently, Hirschhorn and the first author considered the parity of the function $a(n)$ which counts the number of integer partitions of $n$ wherein each part appears with odd multiplicity. They derived an effective characterization of the…

Combinatorics · Mathematics 2022-04-05 James A. Sellers , Fabrizio Zanello

In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…

Number Theory · Mathematics 2025-08-11 James A. Sellers

The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…

Number Theory · Mathematics 2018-09-05 Marie Jameson , Maggie Wieczorek

We present an elementary inductive proof which Euler could have obtained, for the corresponding result as the title indicates, had he refined a bit his proof for Fermat's assertion on representing primes as two squares.

Number Theory · Mathematics 2007-05-23 Ying Zhang

We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…

Computational Geometry · Computer Science 2011-12-21 Bjarke Hammersholt Roune , Eduardo Sáenz de Cabezón

For m>n\geq 0 and 1\leq d\leq m, it is shown that the q-Euler number E_{2m}(q) is congruent to q^{m-n}E_{2n}(q) mod (1+q^d) if and only if m\equiv n mod d. The q-Sali\'e number S_{2n}(q) is shown to be divisible by…

Combinatorics · Mathematics 2011-03-25 Victor J. W. Guo , Jiang Zeng

In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind…

Combinatorics · Mathematics 2014-05-06 Feng Qi

We give a rigorous derivation of the incompressible 2D Euler equation from the von Neumann equation with magnetic field. The convergence is with respect to the modulated energy functional, and implies weak convergence in the sense of…

Analysis of PDEs · Mathematics 2023-07-26 Immanuel Ben Porat

We will study the solution of a congruence, $x \equiv g^{(1/2)\omega_g(2^n)} \bmod 2^n$, depending on the integers $g$ and $n$, where $\omega_g(2^n)$ denotes the order of $g$ modulo $2^n$. Moreover, we introduce an application of the above…

Number Theory · Mathematics 2007-05-23 Soon-Mo Jung

By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power…

Number Theory · Mathematics 2025-10-31 Bernd C. Kellner
‹ Prev 1 3 4 5 6 7 10 Next ›