Related papers: The Primary Pretenders

In this paper we study practical numbers of some special forms. For any integers $b\ge0$ and $c>0$, we show that if $n^2+bn+c$ is practical for some integer $n>1$, then there are infinitely many nonnegative integers $n$ with $n^2+bn+c$…

A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $n$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{n-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Let 0 < a < b be two relatively prime integers and let <a,b> be the numerical semigroup generated by a and b with Frobenius number g(a,b)=ab-a-b. In this note, we prove that there exists a prime number p in <a,b> with p < g(a,b) when the…

The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…

An integral quadratic polynomial is called regular if it represents every integer that is represented by the polynomial itself over the reals and over the $p$-adic integers for every prime $p$. It is called complete if it is of the form…

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…

The multplicative order of an integer g modulo a prime p, with p coprime to g, is defined to be the smallest positive integer k such that g^k is congruent to 1 modulo p. For fixed integers g and d the distribution of this order over residue…

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

Let e>=1 and b>=2 be integers. For a positive integer n=\sum_{j=0}^ka_jb^j with 0<=a_j<b, define T_{e,b}(n)=\sum_{j=0}^ka_j^e. n is called (e,b)-happy if T_{e,b}^r(n)=1 for some r>=0, where T_{e,b}^r is the r-th iteration of T_{e,b}. In…

We construct a sieve that enumerates rational ``imbalances'' of the form $(p-q)/(p+q)$ for integers $p\ge2$ and $1\le q<p$, ordered lexicographically by $(p,q)$. Each imbalance is reduced to lowest terms, and we record the sequence of…

For $h \geq 1$, a $B_h$-set is a set of integers such that every integer $n$ has at most one representation in the form $n = a_{i_1} + \cdots + a_{i_h}$, where $a_{i_j} \in A$ for all $j = 1,\ldots, h$ and $a_{i_1} \leq \ldots \leq…

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…

An s-tuple of positive integers are k-wise relatively prime if any k of them are relatively prime. Exact formula is obtained for the probability that s positive integers are k-wise relatively prime.

In this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a…

Let $S(a,b)=12s(a,b)$, where $s(a,b)$ denotes the classical Dedekind sum. For a given denominator $q\in \mathbb N$, we study the numerators $k\in\mathbb Z$ of the values $k/q$, $(k,q)=1$, of Dedekind sums $S(a,b)$. Our main result says that…

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…

A prime $p$ is called a Wieferich prime if $2^{p-1}\equiv 1 \pmod{p^2}$. A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N\ge 2$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and…

Logarithmic gaps have been used in order to find a periodic component of the sequence of prime numbers, hidden by a random noise (stochastic or chaotic). The recovered period for the sequence of the first 10000 prime numbers is equal to…

Let $K=\mathbb{Q}(\sqrt[n]{a})$ be an extension of degree $n$ of the field $\Q$ of rational numbers, where the integer $a$ is such that for each prime $p$ dividing $n$ either $p\nmid a$ or the highest power of $p$ dividing $a$ is coprime to…