Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1109.1387

Explicit formula for generalization of Poly-Bernoulli numbers and polynomials with a,b,c parameters

Hassan Jolany·Roberto B. Corcino
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we investigate special generalized Bernoulli polynomials with a,b,c parameters that generalize classical Bernoulli numbers and polynomials. The present paper deals with some recurrence formulae for the generalization of poly-Bernoulli numbers and polynomials with a,b,c parameters. Poly-Bernoulli numbers satisfy certain recurrence relationships which are used in many computations involving poly-Bernoulli numbers. Obtaining a closed formula for generalization of poly-Bernoulli numbers with a,b,c paramerers therefore seems to be a natural and important problem. By using the generalization of poly-Bernoulli polynomials with a,b,c parameters of negative index we define symmetrized generalization of poly-Bernoulli polynomials with a,b parameters of two variables and we prove duality property for them. Also by stirling numbers of the second kind we will find a closed formula for them. Furthermore we generalize the Arakawa-Kaneko Zeta functions and by using the Laplace-Mellin integral, we define generalization of Arakawa-Kaneko Zeta functions with a,b parameters and we obtain an interpolation formula for the generalization of poly-Bernoulli numbers and polynomials with a,b parameters. Furthermore we present a link between this type of Zeta functions and Dirichlet series. By our interpolation formula, we will interpolate the generalization of Arakawa-Kaneko Zeta functions with a,b parameters.

Explore related subjects

math.NTmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hassan Jolany, Roberto B. Corcino. 2015-04-09. Explicit formula for generalization of Poly-Bernoulli numbers and polynomials with a,b,c parameters. https://doi.org/10.7153/jca-06-10

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗