Results 31 to 40 of about 3,124,594 (207)
q-deformed integers derived from pairs of coprime integers and its applications [PDF]
, 2022 In connection with cluster algebras, snake graphs and q-integers, Kyungyong Lee and Ralf Schiffler recently found a formula for computing the (normalized) Jones polynomials of rational links in terms of continued fraction expansion of rational numbers ...
Wakui, Michihisa
core +1 more source
On distribution of the number of semisimple rings of order at most x in an arithmetic progression [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 Let ℓ and q denote relatively prime positive integers. In this article, we derive the asymptotic formula for the summation Σ_{n≤x, n≡ℓ (mod q)} S(n), where S(n) denotes the number of non-isomorphic finite semisimple rings with n elements.
Thorranin Thansri +2 more
doaj +1 more source
Resonance between the Representation Function and Exponential Functions over Arithemetic Progression
Journal of Mathematics, 2021 Let rn denote the number of representations of a positive integer n as a sum of two squares, i.e., n=x12+x22, where x1 and x2 are integers. We study the behavior of the exponential sum twisted by rn over the arithmetic progressions ∑n∼Xn≡lmodqrneαnβ ...
Li Ma, Xiaofei Yan
doaj +1 more source
A note on type 2 q-Bernoulli and type 2 q-Euler polynomials
Journal of Inequalities and Applications, 2019 As is well known, power sums of consecutive nonnegative integers can be expressed in terms of Bernoulli polynomials. Also, it is well known that alternating power sums of consecutive nonnegative integers can be represented by Euler polynomials.
Dae San Kim +3 more
doaj +1 more source
Factors of Sums and Alternating Sums of Products of $q$-binomial Coefficients and Powers of $q$-integers [PDF]
Taiwanese journal of mathematics, 2017 We prove that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and non-negative integers $j$ and $r$ with $j\leqslant m$, the following two expressions \begin{align*} &\frac{1}{[n_1+n_m+1]}{n_1+n_{m}\brack n_1}^{-1}\sum_{k=0}^{n_1} q^{j(k^2 ...
Victor J. W. Guo, Su-Dan Wang
semanticscholar +1 more source
The Numerical Evaluation Methods for Beta Function
Süleyman Demirel Üniversitesi Fen-Edebiyat Fakültesi Fen Dergisi, 2022 In this study, the beta function that is encountered in computational mathematics and physics is analyzed. The correct evaluation of this function also affects the accuracy of other mathematical functions in quantum mechanical calculations. Especially in
Sılay Aytaç Yükçü
doaj +1 more source
Uniform approximation by polynomials with integer coefficients [PDF]
Opuscula Mathematica, 2016 Let \(r\), \(n\) be positive integers with \(n\ge 6r\). Let \(P\) be a polynomial of degree at most \(n\) on \([0,1]\) with real coefficients, such that \(P^{(k)}(0)/k!\) and \(P^{(k)}(1)/k!\) are integers for \(k=0,\dots,r-1\).
Artur Lipnicki
doaj +1 more source
Some approximation results on Bleimann-Butzer-Hahn operators defined by (p,q)-integers [PDF]
, 2015 In this paper, we introduce a generalization of the Bleimann-Butzer-Hahn operators based on (p,q)-integers and obtain Korovkin's type approximation theorem for these operators.
M. Mursaleen +3 more
semanticscholar +1 more source
International Journal of Mathematics and Mathematical Sciences, 2004 We consider the modified q-analogue of Riemann zeta function which is defined by ζq(s)=∑n=1∞(qn(s−1)/[n]s ...
Taekyun Kim
doaj +1 more source
RSA: A number of formulas to improve the search for p+qp+q
Journal of Mathematical Cryptology, 2017 Breaking RSA is one of the fundamental problems in cryptography. Due to its reliance on the difficulty of the integer factorization problem, no efficient solution has been found despite decades of extensive research. One of the possible ways to break RSA
Mohammed Ahmed, Alkhelaifi Abdulrahman
doaj +1 more source