arXiv subjects
Publications and source records attributed to Mohamed El Bachraoui.
We evaluate some finite and infinite sums involving $q$-trigonometric and $q$-digamma functions. Upon letting $q$ approach $1$, one obtains corresponding sums for the classical trigonometric and the digamma functions. Our key argument is a theta product formula of Jacobi and Gosper's $q$-trigonometric identities.
We consider convexity and monotonicity properties for some functions related to the $q$-gamma function. As applications, we give a variety of inequalities for the $q$-gamma function, the $q$-digamma function $ψ_q(x)$, and the $q$-series. Among other consequences, we improve a result of Azler~and~Grinshpan about the zeros of the function $ψ_q(x)$. We use $q$-analogues for the Gauss multiplication formula to put in closed form members of some of our inequalities.
We give a new proof for a product formula of Jacobi which turns out to be equivalent to a $q$-trigonometric product which was stated without proof by Gosper. We apply this formula to derive a $q$-analogue for the Gauss multiplication formula for the gamma function. Furthermore, we give explicit formulas for short products of $q$-gamma functions.
We prove some Lambert series which were stated by Gosper without proof or reference. As an application, we shall evaluate integrals involving Ramanujan theta function $ψ(q)$. Furthermore, motivated by Ramanujan's identities for $qψ^4(q^2)$ and $\fr{ψ^3(q)}{ψ(q^3)}$, we shall evaluate the squares of $qψ^4(q^2)$ and $\fr{ψ^3(q)}{ψ(q^3)}$ in terms of Lambert series.
Gosper introduced the functions $\sin_q z$ and $\cos_q z$ as $q$-analogues for the trigonometric functions $\sin z$ and $\cos z$ respectively. He stated but did not prove a variety of identities involving these two $q$-trigonometric functions. In this paper, we shall use the theory of elliptic functions to prove three formulas from the list of Gosper on the functions $\sin_q z$ and $\cos_q z$.
We use an elementary argument to prove some finite sums involving expressions of the forms $(q)_n$ and $(a;q)_n$ along with inductive formulas for some sequences.
We shall answer a question of Mező on the $q$-analogue of the Raabe's integral formula for $0<q<1$ and we shall evaluate an integral involving the first theta function. Moreover, we will reproduce short proofs for some identities of Mező.
In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the $q$-binomial coefficients.
In this note we shall give conditions which guarantee that $\frac{1-q^b}{1-q^a}{n\brack m}\in\mathbb{Z}[q]$ holds. We shall provide a full characterisation for $\frac{1-q^b}{1-q^a}{ka\brack m}\in\mathbb{Z}[q]$. This unifies a variety of results already known in literature. We shall prove new divisibility properties for the binomial coefficients and a new divisibility result for a certain finite sum involving the roots of the unity.
We use sums of Liouville type to count the number of ways a positive integer can be represented by the forms $(a+c)^{1/3}x + (b+d)y$, $(a+c)x + \bigl(k(b+d) \bigr)^{1/3} y$, and $\bigl(k(a+c) \bigr)^{1/3} x + l(b+d) y$ for nonnegative integers $a,b,c,d,k,l,x,y$ under certain relative primality conditions.
We prove the analogue of an identity of Huard, Ou, Spearman and Williams and apply it to evaluate a variety of sums involving divisor functions in two variables. It turns out that these sums count representations of positive integers involving radicals.
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of the coefficients of some infinite products.
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For instance, we shall prove that $$ p(n) = \sum_{d|n} \sum_{k=1}^{d} \sum_{i_0 =1}^{\lfloor d/k \rfloor} \sum_{i_1 =i_0}^{\lfloor\frac{d- i_0}{k-1} \rfloor} \sum_{i_2 =i_1}^{\lfloor\frac{d- i_0 - i_1}{k-2} \rfloor} ... \sum_{i_{k-3}=i_{k-4}}^{\lfloor\frac{n- i_0 - i_1-i_2- ...-i_{k-4}}{3} \rfloor} \sum_{c|(d,i_0,i_1,i_2,...,i_{k-3})} μ(c) (\lfloor \frac{d-i_0-i_1-i_2- ... i_{k-3}}{2c} \rfloor - \lfloor\frac{i_{k-3}-1}{c} \rfloor).$$ Our proofs are elementary.
Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of nonempty subsets of $A$ which are relatively prime and the number of nonempty subsets of $A$ which are relatively prime to $n$. Related formulas are also obtained for the number of such subsets having some fixed cardinality. This extends previous work for the cases where $A$ is an interval or a set in arithmetic progression. Applications include: a) An exact formula is obtained for the number of elements of $A$ which are co-prime to $n$; note that this number is $ϕ(n)$ if $A=[1,n]$. b) Algebraic characterizations are found for a nonempty finite set of positive integers to have elements which are all pairwise co-prime and consequently a formula is given for the number of nonempty subsets of $A$ whose elements are pairwise co-prime. c) We provide combinatorial formulas involving Mertens function.
In this note we give some identities which involve the Mertens function M(n). Our proofs are combinatorial with relatively prime subsets as a main tool.
A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is Φ(A, n) and the number of such subsets of cardinality k is Φ_k(A, n). Given positive integers l1, l2, m2, and n such that l1 <= l2 <= m2 we give Φ([1;m1][[l2;m2]; n) along with Phi_k([1;m1] [ [l2;m2]; n). Given positive integers l;m, and n such that l <= m we count for any subset A of {l,l+1,...,m} the number of its supersets in [l;m] which are relatively prime and we count the number of such supersets which are relatively prime to n. Formulas are also obtained for corresponding supersets having fixed cardinalities. Intermediate consequences include a formula for the number of relatively prime sets with a nonempty intersection with some fixed set of positive integers.