Related papers: Algebraic Results on SP Numbers along with a gener…

One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.

The aim of this paper is to prove conjectures concerning $p$-adic valuations of Stirling numbers of the second kind $S(n,k)$, $n,k\in\mathbb{N}_+$, stated by Amdeberhan, Manna and Moll and Berrizbeitia et al., where $p$ is a prime number.…

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…

We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.

We apply recent bounds of the author (math.PR/0609224) for generalized Smirnov statistics to the distribution of integers whose prime factors satisfy certain systems of inequalities.

In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…

Let $k$ be an algebraically closed field of characteristic $0$. In this paper, we obtain the structure theorems for semisimple Hopf algebras of dimension $p^2q^2$ over $k$, where $p,q$ are prime numbers with $p^2<q$. As an application, we…

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 obtain a lower bound for the number of primes $p\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and…

Let $p$ be an odd prime. We describe a method to compute the Schur multiplier of finite $p$-groups $G$ of nilpotency class $2$ such that $G/[G,G]$ is isomorphic to direct product of copies of $\mathbb{Z}_{p^s}$ for $s \in \mathbb{N}$,…

It is well-known that pythagorean triples can be represented by points of the unit circle with rational coordinates. These points form an abelian group, and we describe its structure. This structural description yields, almost immediately,…

In a paper published by this author in www.academia.edu(see reference[3]), it was established that there exist no three positive integers which are consecutive terms of an arithmetic progression; and whose sum of squares is a perfect or…

Let S=K[x_1,...,x_n] be a polynomial ring. Denote by $p_a$ the power sum symmetric polynomial x_1^a+...+x_n^a. We consider the following two questions: Describe the subsets $A \subset \mathbb{N}$ such that the set of polynomials $p_a$ with…

In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.

Using the sieve, we show that there are infinitely many Carmichael numbers whose prime factors all have the form $p = 1 + a^2 + b^2$ with $a,b \in{\mathbb Z}$.

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

Bag and Shparlinski \cite{BaSh} considered bilinear sums of terms of the form $e_p(axy^s)$, where $p$ is a prime, $a$ is an integer coprime to $p$, $s$ is an integer, $x$ runs over a subset of $\mathbb{F}_p^{\ast}$ and $y$ runs over an…

Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…

The purpose of this note is to report on the discovery of the primes of the form $p=1+n!\sum n$, for some natural numbers $n>0$. The number of digits in the prime p are approximately equal to $\lfloor log_{10}(1+n!\sum n)\rceil+1$.

For a prime $p$ and a matrix $A \in \mathbb{Z}^{n \times n}$, write $A$ as $A = p (A \,\mathrm{quo}\, p) + (A \,\mathrm{rem}\, p)$ where the remainder and quotient operations are applied element-wise. Write the $p$-adic expansion of $A$ as…