Related papers: Carmichael number variable relations: three-prime …
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…
We arrive at some new relations for the prime number $P_n$, based on the logarithmic and absolute-value properties of the function $\pi(x)$.
In this paper, we study the Carlitz's degenerate Bernoulli numbers and polynomials and give some formulae and identities related to those numbers and polynomials.
Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We…
The generalized complex numbers can be realized in terms of $2\times2$ or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of…
Various families of octonion number sequences (such as Fibonacci octonion, Pell octonion and Jacobsthal octonion) have been established by a number of authors in many different ways. In addition, formulas and identities involving these…
Although 10^230 terms of Recaman's sequence have been computed, it remains a mystery. Here three distant cousins of that sequence are described, one of which is also mysterious. (i) {A(n), n >= 3} is defined as follows. Start with n, and…
Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This…
In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than $1$ are simple and also the multiplicity of Laplacian eigenvalue $1$ has been well studied…
We prove new bounds for how often Dirichlet polynomials can take large values. This gives improved estimates for a Dirichlet polynomial of length $N$ taking values of size close to $N^{3/4}$, which is the critical situation for several…
A new recurrence relation for exceptional orthogonal polynomials is proposed, which holds for type 1, 2 and 3. As concrete examples, the recurrence relations are given for Xj-Hermite, Laguerre and Jacobi polynomials in j = 1,2 case.
In this paper, we prove that for any $a,M\in \mathbb N$ with $(a,M)=1$, there are infinitely many Carmichael numbers $m$ such that $m\equiv a$ mod $M$
This semi-expository paper surveys results concerning three classes of orthogonal polynomials: in one non-hermitian variable, in several isometric non-commuting variables, and in several hermitian non-commuting variables. The emphasis is on…
By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…
We survey large value problems, including the large value problem for Dirichlet polynomials, the restriction problem, and problems from computer science. We describe known techniques and open problems, drawing on perspectives from all three…
Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…
We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…
We show that a randomly chosen 3-CNF formula over n variables with clauses-to-variables ratio at least 4.4898 is, as n grows large, asymptotically almost surely unsatisfiable. The previous best such bound, due to Dubois in 1999, was 4.506.…
Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…
Formula for the nth prime using elementary arithmetical functions based in a previous formula changing the characteristic function of prime numbers.