English
Related papers

Related papers: A Fixed-Prime Criterion for Reciprocals in Missing…

200 papers

Let $M_{d,n}(q)$ denote the number of monic irreducible polynomials in $\mathbb{F}_q[x_1, x_2, \ldots , x_n]$ of degree $d$. We show that for a fixed degree $d$, the sequence $M_{d,n}(q)$ converges $q$-adically to an explicitly determined…

Number Theory · Mathematics 2018-09-10 Trevor Hyde

Let $C$ be the middle-third Cantor set. We show that \[\left\{\frac{1}{n!}: n\in\mathbb{N}\right\}\cap C=\left\{1, \frac{1}{5!}\right\}.\] This answers a question recently posed by Jiang [J. Lond. Math. Soc., 2026, published online]. Our…

Number Theory · Mathematics 2026-04-14 Kehao Lin , Yufeng Wu , Siyu Yang

We study the rational dynamics of the map $\mathcal{T}(x)=\lfloor x\rfloor(1+\{x\})$, which appears in the recursive construction of the prime-representing constant of Fridman, Garbulsky, Glecer, Grime and Florentin. For a rational number…

Number Theory · Mathematics 2026-05-22 André Carvalho

Let K be a number field or a function field of characteristic 0, let f be a K-rational function of degree greater than 1, and let a be an element of K. Let S be a finite set of places of K containing all the archimedean ones and the primes…

Number Theory · Mathematics 2016-08-05 Dragos Ghioca , Khoa D. Nguyen , Thomas J. Tucker

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

Group Theory · Mathematics 2023-06-05 Attila Maróti , Saveliy V. Skresanov

For a rational polynomial $f$ and rational numbers $c, u$, we put $f_c(x):=f(x)+c$, and consider the Zsigmondy set $\mathcal{Z}(f_c,u)$ associated to the sequence $\{f_c^n(u)-u\}_{n\geq 0}$, where $f_c^n$ is the $n$-st iteration of $f_c$.…

Dynamical Systems · Mathematics 2020-10-29 Rufei Ren

A commutative semigroup of abstract factorials is defined in the context of the ring of integers. We study such factorials for their own sake, whether they are or are not connected to sets of integers. Given a subset X of the positive…

Number Theory · Mathematics 2012-07-11 Angelo B. Mingarelli

We present a special-purpose algorithm for factoring semiprimes $N = pq$ in which one prime factor satisfies $p \approx c\,(a/b)^n$ for positive integers $a, b, c, n$ with $a > b$ and $\gcd(a,b) = 1$. Given the correct parameters $(a, b)$,…

Number Theory · Mathematics 2026-05-12 Sam Blake

For a prime $p$ and a matrix $A \in \mathbb{Z}^{n \times n}$, write $A$ as $A = p (A \,\mathrm{quo}\, p) + (A \,\mathrm{rem}\, p)$ where the remainder and quotient operations are applied element-wise. Write the $p$-adic expansion of $A$ as…

Number Theory · Mathematics 2014-02-03 Mustafa Elsheikh , Andy Novocin , Mark Giesbrecht

We introduce a discrete dynamical system on the integers, defined by moving a composite $m$ forward to $m+\pi(m)$ and a prime $p$ backward to $p-\mathrm{prevprime}(p)$. This map produces trajectories whose contraction properties are closely…

General Mathematics · Mathematics 2025-09-16 Hendrik Wladimir Albrecht Edwin Kuipers

In this article, we investigate the $p$-adic valuation $\nu_p$ of quantities such as the factorial $n!$, the hyperfactorial $H(n)$ or the superfactorial $\mathrm{sf}(n)$. In particular, we obtain simple bounds (both upper and lower) for…

Number Theory · Mathematics 2024-08-02 Jean-Christophe Pain

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

Number Theory · Mathematics 2026-04-28 Dan Levy

We consider formal verification of recursive programs with resource consumption. We introduce prefix replacement systems with non-negative integer counters which can be incremented and reset to zero as a formal model for such programs. In…

Logic in Computer Science · Computer Science 2015-07-01 Martin Lang , Christof Löding

Let $p$ be a prime number. We consider diagonal $p$-permutation functors over a (commutative, unital) ring $\mathsf{R}$ in which all prime numbers different from $p$ are invertible. We first determine the finite groups $G$ for which the…

Group Theory · Mathematics 2024-11-11 Serge Bouc , Deniz Yılmaz

In this paper, we will show that the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers is unusually large. This generalizes the very recent results by the author and by A. Dubickas, which are both…

Number Theory · Mathematics 2022-12-02 Bakir Farhi

For $m,q \in \mathbb{N}$, we call an $m$-tuple $(a_1,\ldots,a_m) \in \prod_{i=1}^m (\mathbb{Z}/q\mathbb{Z})^\times$ good if there are infinitely many consecutive primes $p_1,\ldots,p_m$ satisfying $p_i \equiv a_i \pmod{q}$ for all $i$. We…

Number Theory · Mathematics 2024-09-20 Cheuk Fung Lau

The unconditional, i.e. without assuming validity of RH, sharp limit relationship (as p tends to infinity) is found between the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals and maximal values of…

Number Theory · Mathematics 2026-03-26 Gennadiy A. Kalyabin

Let I be a finitely supported complete m-primary ideal of a regular local ring (R, m). A theorem of Lipman implies that I has a unique factorization as a *-product of special *-simple complete ideals with possibly negative exponents for…

Commutative Algebra · Mathematics 2014-01-15 William Heinzer , Mee-Kyoung Kim , Matthew Toeniskoetter

This article studies the equation $[A,B]^k = {\rm Id}_n$ for matrices over $\mathbb{C}$, characterizing the pairs $(k,n)$ for which solutions exist via a classical result of Lam and Leung on sums of roots of unity. The problem is next…

Rings and Algebras · Mathematics 2026-05-12 Arijit Mukherjee , Gobinda Sau , Arindam Sutradhar

For linear recurrence systems, the problem of finding rational solutions is reduced to the problem of computing polynomial solutions by computing a content bound or a denominator bound. There are several bounds in the literature. The…

Symbolic Computation · Computer Science 2020-07-07 Mark van Hoeij , Moulay Barkatou , Johannes Middeke
‹ Prev 1 2 3 10 Next ›