Related papers: On the location and classification of all prime nu…

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

Let A_n be the alternating group on n letters. For n>5, we describe the elements alpha, beta in A_n when alpha^{A_n} beta^{A_n} is the union of at most four distinct conjugacy classes.

The set of all $\ell$-zero-sumfree subsets of $\mathbb{Z}/n\mathbb{Z}$ is a simplicial complex denoted by $\Delta_{n,\ell}$ We create an algorithm via defining a set of integer partitions we call $(n,\ell)$-congruent partitions in order to…

The class of all quasigroups is covered by six classes: the class of all asymmetric quasigroups and five varieties of quasigroups (commutative, left symmetric, right symmetric, semi-symmetric and totally symmetric). Each of these classes is…

Here we demonstrate a sieve for analysing primes and their composites, using equivalence classes based on the modulo 6 return value as applied to the Natural numbers. Five features of this 'Hexile' sieve are reviewed. The first aspect, is…

Let $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…

Let $\Delta(n)$ denote the smallest positive integer $m$ such that $a^3+a(1\le a\le n)$ are pairwise distinct modulo $m$. The purpose of this paper is to determine $\Delta(n)$ for all positive integers $n$.

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

We give several families of reasonably small integers $k, \ell \ge 1$ and real positive $\alpha, \beta \le 1$, such that the products $p_1\ldots p_k s$, where $p_1, \ldots, p_k \le m^\alpha$ are primes and $s \le m^\beta$ is a product of at…

We present a collection of results concerning the structure of reversible gate classes over non-binary alphabets, including (1) a reversible gate class over non-binary alphabets that is not finitely generated (2) an explicit set of…

A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…

For an $n$-bit positive integer $a$ written in binary as $$ a = \sum_{j=0}^{n-1} \varepsilon_{j}(a) \,2^j $$ where, $\varepsilon_j(a) \in \{0,1\}$, $j\in\{0, \ldots, n-1\}$, $\varepsilon_{n-1}(a)=1$, let us define $$ \overleftarrow{a} =…

It is shown that for positive real numbers $ 0<\lambda_{1}<\dots<\lambda_{n}$, $\left[\frac{1}{\beta({\lambda_i}, {\lambda_j})}\right]$, where $ \beta(\cdot,\cdot)$ denotes the beta function, is infinitely divisible and totally positive.…

We develop categorical and number theoretical tools for the classification of super-modular categories. We apply these tools to obtain a partial classification of super-modular categories of rank $8$. In particular we find three distinct…

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

Generalizing the concept of a perfect number is a Zumkeller or integer perfect number that was introduced by Zumkeller in 2003. The positive integer $n$ is a Zumkeller number if its divisors can be partitioned into two sets with the same…

For any $k\geq 1$, we study the distribution of the difference between the number of integers $n\leq x$ with $\omega(n)=k$ or $\Omega(n)=k$ in two different arithmetic progressions, where $\omega(n)$ is the number of distinct prime factors…

In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time…

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…