Results 31 to 40 of about 9,658 (272)
Uniform approximation by polynomials with integer coefficients [PDF]
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
Efficient q-integer linear decomposition of multivariate polynomials [PDF]
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and for describing the q-counterpart of Ore-Sato theory.
Giesbrecht, Mark +3 more
openaire +2 more sources
Statistical approximation properties of Stancu type q-Baskakov-Kantorovich operators [PDF]
In the present paper, we consider Stancu type generalization of Baskakov-Kantorovich operators based on the q-integers and obtain statistical and weighted statistical approximation properties of these operators.
Jain, Dilip +3 more
core +1 more source
The q-Integers and the Mersenne Numbers [PDF]
Here we will show that the q-integers, the q-analogue of the integers that we can find in the q-calculus, are forming an additive group having a generalized sum similar to the sum of the Tsallis q-entropies of independent systems. The symmetric form of q-integers will be studied too.
openaire +2 more sources
A note on the values of the weighted q-Bernstein polynomials and modified q-Genocchi numbers with weight alpha and beta via the p-adic q-integral on Zp [PDF]
The rapid development of q-calculus has led to the discovery of new generalizations of Bernstein polynomials and Genocchi polynomials involving q-integers.
DS Kim +25 more
core +2 more sources
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
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
The unit group of some fields of the form $\mathbb{Q}(\sqrt2, \sqrt{p}, \sqrt{q}, \sqrt{-l})$ [PDF]
Let $p$ and $q$ be two different prime integers such that $p\equiv q\equiv3\pmod8$ with $(p/q)=1$, and $l$ a positive odd square-free integer relatively prime to $p$ and $q$.
Moha Ben Taleb El Hamam
doaj +1 more source
General Gamma type operators based on q-integers
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karslı, Harun +2 more
openaire +1 more source
Some notes about power residues modulo prime
Let q be a prime. We classify the odd primes p ≠ q such that the equation x2 ≡ q (mod p) has a solution, concretely, we find a subgroup L4q of the multiplicative group U4q of integers relatively prime with 4q (modulo 4q) such that x2 ≡ q (mod p) has a ...
Diego Alejandro Mejía Guzmán +1 more
doaj

