Abstract
For a nonzero integer let be given by , where is the greatest integer not exceeding . As is the Euler number, can be viewed as a generalization of Euler numbers. Let and be positive integers, and let be a nonnegative integer. In this paper, we determine modulo for . For we also establish congruences for and where , and is Euler's function.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.