Pith. sign in

REVIEW

On Euler numbers modulo powers of two

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0410085 v3 pith:BN5YGCB7 submitted 2004-10-05 math.NT math.CO

On Euler numbers modulo powers of two

classification math.NT math.CO
keywords eulermodulonumberspowersachieveapplyclassicalcongruence
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

To determine Euler numbers modulo powers of two seems to be a difficult task. In this paper we achieve this and apply the explicit congruence to give a new proof of a classical result due to M. A. Stern.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.