Search arXivSearch

arXiv · 2512.07416

Harmonic Geometric Polynomials via Geometric Polynomials and Their Applications

Abstract

The aim of this study is to show that harmonic geometric polynomials can be represented in terms of geometric polynomials. This problem was first considered by Keller [14]; however, the corresponding coefficients were not fully determined. In the present work, we provide several explicit representations of harmonic geometric polynomials in terms of geometric polynomials. Moreover, several applications of one of these representations are subsequently developed. In particular, we obtain a generalization of the classical identity for the harmonic numbers, compute an integral involving harmonic geometric polynomials and an integral involving products of harmonic geometric and geometric polynomials in terms of Bernoulli numbers. These integral formulas lead to new explicit expressions for Bernoulli numbers. In addition, we give several recurrence relations for harmonic geometric polynomials and evaluate a finite sum involving harmonic numbers and positive powers of integers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pınar Akkanat, Levent Kargın. 2025-12-08. Harmonic Geometric Polynomials via Geometric Polynomials and Their Applications. https://arxiv.org/abs/2512.07416

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

KEEP EXPLORING

Related papers

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

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