Related papers: On $S$-Prime Element Principle

Simple divisibility rules are given for the 1st 1000 prime numbers.

We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.

We present a detailed proof of the prime number theorem suitable for a typical undergraduate- or graduate-level complex analysis course. Our presentation is particularly useful for any instructor who seeks to use the prime number theorem…

We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…

Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…

I give some claims on primorial prime numbers for interested readers in number theory.

This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and $s$-permutahedra, certain discrete objects that are indexed by a sequence of non-negative integers $s$. In this first paper, we concentrate…

The Sasaki projection was introduced as a mapping from the lattice of closed subspaces of a Hilbert space onto one of its segments. To use this projection and its dual so-called Sasaki operations were introduced by the second two authors.…

In this sequel paper, we continue the analysis of the prime order element graph $\Gamma(G)$ of a finite group $G$, where vertices are elements of $G$ and edges connect distinct elements $x, y$ satisfying $\circ(xy) = p$ for some prime $p$.…

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…

A planar semimodular lattice is slim if it does not contain $M_3$ as a sublattice. An SPS lattice is a slim, planar, semimodular lattice. A recent result of G\'abor Cz\'edli proves that there is an eight element (planar) distributive…

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

We show that if the difference of two elements of a set $A \subseteq [N]$ is never one less than a prime number, then $|A| = O (N \exp (-c (\log N)^{1/3}))$ for some absolute constant $c>0$.

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

This paper investigates prime and co-prime integer matrices and their properties. It characterizes all pairwise co-prime integer matrices that are also prime integer matrices. This provides a simple way to construct families of pairwise…

Let $r \geq 2$ be an integer, $q$ a prime power and $\mathbb{F}_{q}$ the finite field with $q$ elements. Consider the problem of showing existence of primitive elements in a subset $\mathcal{A} \subseteq \mathbb{F}_{q^r}$. We prove a sieve…

Let R be a Krasner (m,n)-hyperring and S be an n-ary multiplicative subset of R. The purpose of this paper is to introduce the notion of n-ary S-prime hyperideals as a new expansion of n-ary prime hyperideals. Several properties and…

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

We give a combinatorial proof that congruence permutability is prime in the lattice of interpretability types of varieties. Thereby, we settle a 1984 conjecture of Garcia and Taylor.

We prove that in a theory $T$ stable over a predicate $P$, for any $\lambda > |T|$, there is a $\lambda$-prime model over any complete set A with a $\lambda$-saturated $P$-part.