Consider the linear congruence equation $x_1+...+x_k\equiv b(mod{n}^s)$ for $b\in \mathbb{Z}$, $n,s\in \mathbb{N}$. Let ${(a,b)}_s$ denote the generalized gcd of $a$ and $b$ which is the largest $l^s$ with $l\in \mathbb{N}$ dividing $a$ and $b$ simultaneously. Let $d_1,...,d_{\tau \left(n\right)}$ be all positive divisors of $n$. For each $d_j\mid n$, define ${𝒞}_{j,s}\left(n\right)=\{1\le x\le n^s:{(x,n^s)}_s=d_j^s\}$. K. Bibak et al. (2016) gave a formula using Ramanujan sums for the number of solutions of the above congruence equation with some gcd restrictions on $x_i$. We generalize their result with generalized gcd restrictions on $x_i$ and prove that for the above linear congruence, the number of solutions...

A generalized convolution with a weight function for the Fourier cosine and sine transforms is introduced. Its properties and applications to solving a system of integral equations are considered.

We prove a law of the iterated logarithm for sums of the form ${\sum }_{k=1}^N{a}_{k}f\left(n_{k}x\right)$ where the $n_k$ satisfy a Hadamard gap condition. Here we assume that f is a Dini continuous function on ℝⁿ which has the property that for every cube Q of sidelength 1 with corners in the lattice ℤⁿ, f vanishes on ∂Q and has mean value zero on Q.

The q-convolution is a measure-preserving transformation which originates from non-commutative probability, but can also be treated as a one-parameter deformation of the classical convolution. We show that its commutative aspect is further certified by the fact that the q-convolution satisfies all of the conditions of the generalized convolution (in the sense of Urbanik). The last condition of Urbanik's definition, the law of large numbers, is the crucial part to be proved and the non-commutative...

We prove a lower bound in a law of the iterated logarithm for sums of the form ${\sum }_{k=1}^N{a}_{k}f(n_{k}x+c_k)$ where f satisfies certain conditions and the $n_k$ satisfy the Hadamard gap condition $n_{k+1}/n_k\ge q>1$.

A systematic method for the calculus of Bernstein's polynomial is described. It consists of reducing the problem to a homogeneous linear system of equations that may be constructed by fixed rules. Several problems about its computer implementation are discussed.

We prove the central limit theorem for the multisequence ${\sum }_{1\le n₁\le N₁}\cdots {\sum }_{1\le n_d\le N_d}{a}_{n₁,...,n_d}cos(⟨2\pi m,A{₁}^{n₁}...A_d^{n_d}x⟩)$ where $m\in {\mathbb{Z}}^s$, $a_{n₁,...,n_d}$ are reals, $A₁,...,A_d$ are partially hyperbolic commuting s × s matrices, and x is a uniformly distributed random variable in ${[0,1]}^s$. The main tool is the S-unit theorem.