Related papers: Squarefree smooth numbers and Euclidean prime gene…

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…

We extend Mullin's prime-generating procedures to produce sequences of primes lying in given residue classes. In particular we study the sequences generated by cyclotomic polynomials $\Phi_m(cx)$ for suitable $c\in\mathbb{Z}$. Under the…

A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $\Gamma_0(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$…

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

In this note we prove that for every integer $d \geq 1$, there exists an explicit constant $B_d$ such that the following holds. Let $K$ be a number field of degree $d$, let $q > \max\{d-1,5\}$ be any rational prime that is totally inert in…

In his paper Almost-Primes Represented by Quadratic Polynomials, Iwaniec proved that the polynomial n^2 + 1 takes on values with at most two prime factors (counted with multiplicity) infinitely often. He states that "in order to avoid…

We give an algorithm to enumerate all primitive abundant numbers (briefly, PANs) with a fixed $\Omega$ (the number of prime factors counted with their multiplicity), and explicitly find all PANs up to $\Omega=6$, count all PANs and…

Let $p$ be an odd prime. In this paper we investigate quadratic residues modulo $p$ and related permutations, congruences and identities. If $a_1<\ldots<a_{(p-1)/2}$ are all the quadratic residues modulo $p$ among $1,\ldots,p-1$, then the…

We settle an open problem regarding palindromes; that is, positive integers which are the same when written forwards and backwards. In particular, we prove that for any fixed base $b\geq 2$, there exist infinitely many square-free…

In this paper we show that there exist infinitely many square-free numbers of the form $n^2+n+1$. We achieve this by deriving an asymptotic formula by improving the reminder term from previous results.

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

Let $I$ be an arbitrary nonzero squarefree monomial ideal of dimension $d$ in a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_n]$. Let $\mu$ be the number of associated primes of $S/I$ of dimension $d$. We prove that the multiplicity of…

Two conjectures, posed by Finch-Smith, Harrington, and Wong in a paper published in Integers in $2023$, are proven. Given a monic biquadratic polynomial $f(x) = x^4 + cx^2 + e$, we prove a formula for the sum of its distinct outputs modulo…

In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to…

We give an upper bound for the exponential sum over squarefree integers. This establishes a conjecture by Br\"udern and Perelli.

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption…