Related papers: Convergence and generalization of a recursion equa…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
A generalization of the term "generalized Clifford algebras" (as appears in papers on advances in applied Clifford algebras) is introduced. This algebra is studied by means of structure theory of central simple algebras. A graph theoretical…
We study new primality tests based on linear recurrent sequences of degree two exploiting a matricial approach. The classical Lucas test arises as a particular case and we see how it can be easily improved. Moreover, this approach shows…
We study a generalization of Pell's equation, whose coefficients are certain algebraic integers. Let $X_0=0$ and $X_n=\sqrt{2+X_{n-1}}$ for each $n\in \mathbb{Z}_{\ge 1}$. We study the $\mathbb{Z}[X_{n-1}]$-solutions of the equation…
We introduce a generalized $k$-FL sequence and special kind of pairs of real numbers that are related to it, and give an application on the integral solutions of a certain equation using those pairs. Also, we associate skew circulant and…
Several examples of generalized number systems are constructed to compare various conditions occurring in the literature for the prime number theorem in the context of Beurling generalized primes.
In this work I look at the distribution of primes by calculation of an infinite number of intersections. For this I use the set of all numbers which are not elements of a certain times table in each case. I am able to show that it exists a…
In the present paper we generalize the Eulerian numbers (also of the second and third orders). The generalization is connected with an autonomous first-order differential equation, solutions of which are used to obtain integral…
We generalize Killing equations to a test particle system which is subjected to external force. We relax the conservation condition by virtue of reparametrization invariance of a particle orbit. As a result, we obtain generalized Killing…
In this paper we introduce I^K-convergence which is a common generalization of the I^K-convergence of sequences, double sequences and nets. We show that many results that were shown before for these special cases are true for the…
Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…
In the paper, we generalize some congruences of Lehmer for general composite numbers.
We prove general fomulas for the deviations of two overpartition ranks from the average. These formulas are in terms of Appell--Lerch series and sums of quotients of theta functions and can be used, among other things, to recover any of the…
Convergence results are stated for the variational iteration method applied to solve an initial value problem for a system of ordinary differential equations.
We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.
In this paper we study the convergence of multiple Dirichlet L-series. In particular we give an integral representation of the series in the region of convergence by using Abel's summation formula. A certain generalized result is also…
For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity.…
We generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition.