相关论文: Smarandache Type Function Obtained by Duality
In this article we gave a recurrence to obtain the n-th prime number as function of the (n-1)-th prime number.
The purpose of this article is to introduce q-deformed Stirling numbers of the first and second kinds. Relations between these numbers, Riemann zeta function and q-Bernoulli numbers of higher order are given. Some relations related to the…
We construct new integral representations for transformations of the ordinary generating function for a sequence, $\langle f_n \rangle$, into the form of a generating function that enumerates the corresponding "square series" generating…
In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…
We introduce a new generalization of Stirling numbers of the second kind and analyze their properties, including generating functions, integral representations, and recurrence relations. These numbers are used to approximate Riemann zeta…
The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…
The aim of this paper is to study the $\lambda$-Stirling numbers of both kinds which are $\lambda$-analogues of Stirling numbers of both kinds. Those numbers have nice combinatorial interpretations when $\lambda$ are positive integers. If…
The manuscript reviews Dirichlet Series of important multiplicative arithmetic functions. The aim is to represent these as products and ratios of Riemann zeta-functions, or, if that concise format is not found, to provide the leading…
Stirling numbers of both kinds are linked to each other via two combinatorial identities due to Schl\"afli and Gould. Using q-analogs of Stirling numbers defined as inversion generating functions, we provide q-analogs of the two identities.…
This short paper presents an exact formula for counting twin prime pairs less than or equal to x in terms of the classical Smarandache Function. An extension of the formula to count prime pairs (p, p+2n), n > 1, is also given.
In this article we see that the value takes the Smarandache Function when it is applied to a perfect number.
The aim of this paper is to give a new approach to modified q-Bernstein polynomials for functions of two variables. By using these type polynomials, we derive recurrence formulas and some new interesting identities related to the second…
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
We investigate the worldline quantum field theory (WQFT) formalism for scalar-QED and observe that a generating function emerges from WQFT, from which the scattering angle ensues. This generating function bears important similarities with…
Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…
We define dual equivalence for any collection of combinatorial objects endowed with a descent set, and we show that giving a dual equivalence establishes the symmetry and Schur positivity of the quasi-symmetric generating function. We give…
We answer a number of questions relating to the pseudo-Smarandache function Z(n). We show that the ratio of consecutive values $Z(n+1)/Z(n)$ and $Z(n-1)/Z(n)$ are unbounded; that $Z(2n)/Z(n)$ is unbounded; that $n/Z(n)$ takes every integer…
Obtained a new property of superposition of the generating functions ln(1/(1-F(x))), where F(x) - generating function with integer coefficients, which allows the construction a primality tests. The theorem which is based on compositions of…
Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to…
Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive…