Abstract
In this paper, we prove a discrete analog of Euler's summation formula. The difference from the classical Euler formula is in that the derivatives are replaced by finite differences and the integrals by finite sums. Instead of Bernoulli numbers and Bernoulli polynomials, special numbers Pn and special polynomials Pn(x) introduced by Korobov in 1996 appear in the formula.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
