Related papers: A note on solitary numbers

We determine the squarefree part of the scalar factor that arises when the quartic invariant of the generic binary form $F$ of odd degree $2n+1$ is expressed as the discriminant of the unique quadratic covariant $(F,F)_{2n}$. This…

Let $\mathbb{F}_q$ be a finite field of odd characteristic containing $q$ elements and integer $n\ge 1$. In this paper, the explicit factorization of $x^{2^nd}-1$ over $\mathbb{F}_q$ is obtained when $d$ is an odd divisor of $q+1$.

Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denote the distance from $x$ to the nearest integer. In this paper we show that whenever $\alpha$ is irrational and $\beta$ is real then for any fixed $\frac{13}{14}<\gamma<1$, there…

Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

Let $Q$ be a set of primes with relative density $\delta$. We count integers in $[1,x]$ with prime factors all in $Q$ that also have a divisor in $(y,2y]$. We establish the order of magnitude for all $\delta \in (0,1]$. This generalizes the…

While solving a special case of a question of Erd\H{o}s and Graham Steinerberger asks for all integers $n$ with $\phi(n)=\frac{2}{3} \cdot (n+1)$. He discovered the solutions $n\in\{5, 5 \cdot 7, 5\cdot 7\cdot 37, 5\cdot 7\cdot 37\cdot…

Hasanalizade [1] studied Deaconescu's conjecture for positive composite integer $n$. A positive composite integer $n\geq4$ is said to be a Deaconescu number if $S_2(n)\mid \phi(n)-1$. In this paper, we improve Hasanalizade's result by…

Let $\mathbb{Z}_n$ denote the ring of integers modulo $n$. In this paper we consider two extremal problems on permutations of $\mathbb{Z}_n$, namely, the maximum size of a collection of permutations such that the sum of any two distinct…

One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact in a proof. The purpose of this note is to describe a specific instance where this can occur, namely in results…

The fibbinary numbers are positive integers whose binary representation contains no consecutive ones. We prove the following result: If the $j$th odd fibbinary is the $n$th \emph{odd} fibbinary number, then $j = \lfloor n\phi^2 \rfloor -…

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

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…

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…

We consider a variant of a question of N. Koblitz. For an elliptic curve $E/\Q$ which is not $\Q$-isogenous to an elliptic curve with torsion, Koblitz has conjectured that there exists infinitely many primes $p$ such that…

We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…

We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…

A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…

Let $q$ be an odd prime power and write \[ \theta_q := \frac{\phi(q-1)}{q-1}. \] If $\theta_q < \tfrac{1}{3}$, or if $\theta_q = \tfrac{1}{3}$ and $q \notin \{7,13,19,25,37\}$, then the finite field $\F$ contains a pair of consecutive…

We will show the two following results: If there existe an odd perfect number $n$ of prime decomposition $n=p_1^{\alpha_1} \ldots p_k^{\alpha_k}q^\beta$, where the $\alpha_i$ are even, the $\beta$ are odd and $q \equiv 5 \mod 8$. Then there…