2022
DOI: 10.1002/mma.8321
|View full text |Cite
|
Sign up to set email alerts
|

Derivation of computational formulas for certain class of finite sums: Approach to generating functions arising from p$$ p $$‐adic integrals and special functions

Abstract: The aim of this paper is to construct generating functions for certain families of special finite sums by using the Newton–Mercator series, hypergeometric functions, and p$$ p $$‐adic integral. By using these generating functions with their functional and partial derivative equations, many novel computational formulas involving the special finite sums of (inverse) binomial coefficients, the Bernoulli type polynomials and numbers, Euler polynomials and numbers, the Stirling numbers, the (alternating) harmonic … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
11
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(11 citation statements)
references
References 25 publications
0
11
0
Order By: Relevance
“…(see also Simsek, 2021cSimsek, , 2021d2022b, 2022c. Simsek (2022b (Equation (59))) gave the following formula 𝒚(𝑟 − 1, 𝜗) + (𝜗 − 1)𝒚(𝑟, 𝜗) = (−1) 𝑟 (𝑟 + 1)𝜗 𝑟+1 .…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…(see also Simsek, 2021cSimsek, , 2021d2022b, 2022c. Simsek (2022b (Equation (59))) gave the following formula 𝒚(𝑟 − 1, 𝜗) + (𝜗 − 1)𝒚(𝑟, 𝜗) = (−1) 𝑟 (𝑟 + 1)𝜗 𝑟+1 .…”
Section: Introductionmentioning
confidence: 99%
“…(for detail, see Simsek, 2021bSimsek, , 2021cSimsek, , 2021d2022b, 2022c. From the above equation, we have (Simsek, 2021b(Simsek, , 2021c2022b, 2022c.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Remark 5. Putting 𝑣 = 0, 𝜆 = 𝑝 = 1 in (6), we have (49), which is also given by generating function (32). By using (32), Charalambides 7 Exercise 30*, p. 272 also gave the following formulas:…”
mentioning
confidence: 99%
“…Here, using generating functions with their functional equations, we obtain some novel formulas for the sums of inverses of binomial coefficients derived from the numbers 𝑦 (𝑚, 𝜆). By combining (32) with ( 11) and ( 13) yields the following functional equation:…”
mentioning
confidence: 99%