English
Related papers

Related papers: Pairwise non-coprimality of triples

200 papers

The immaculate basis of the non-commutative symmetric functions was recently introduced by the first and third author to lift certain structures in the symmetric functions to the dual Hopf algebras of the non-commutative and quasi-symmetric…

Combinatorics · Mathematics 2016-11-08 Nantel Bergeron , Juana Sánchez-Ortega , Mike Zabrocki

In the Frobenius problem we are given a set of coprime, positive integers $a_1, a_2,...,a_k$, and are interested in the set of positive numbers NR that have no representation by the linear form $\sum_i a_ix_i$ in nonnegative integers $x_1,…

Number Theory · Mathematics 2007-05-23 Hans J. H. Tuenter

It is not difficult to find an asymptotic formula for the number of pairs of positive integers $x, y \le H$ such that $x^2 + y^2 + 1$ is squarefree. In the present paper we improve the estimate for the error term in this formula using the…

Number Theory · Mathematics 2010-09-13 Doychin Tolev

Let f be an irreducible polynomial of degree d>=3 with no fixed prime divisor. We derive an asymptotic formula for the number of primes p<x such that f(p) is (d-1)-free.

Number Theory · Mathematics 2015-06-12 Thomas Reuss

This paper considers a probabilistic-analytical approach to determining asymptotics of prime objects on the initial interval of the natural series. The author proposes a new method based on the construction of a probability space. An…

Number Theory · Mathematics 2025-04-01 Victor Volfson

There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of pi_{2r}(x), the number of prime pairs (p,p+2r) with p not exceeding x. However, it is still not known…

Number Theory · Mathematics 2008-06-06 Jacob Korevaar

In this paper, we prove an asymptotic formula for the number of relatively prime pairs in the Piatetski-Shapiro sequence of arbitrarily large order. This improves the result of Pimsert, Srichan and Tangsupphathawat (2023), the order of…

Number Theory · Mathematics 2024-03-19 Yuta Suzuki

A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f(n)$ the number of maximum-size primitive subsets of $\{1,\ldots, 2n\}$. We prove that the limit $\alpha=\lim_{n\rightarrow…

Combinatorics · Mathematics 2023-06-22 Hong Liu , Péter Pál Pach , Richárd Palincza

Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

Number Theory · Mathematics 2021-03-19 Sándor Z. Kiss , Csaba Sándor

We use the group $(\Z^2,+)$ and two associated homomorphisms, $\tau_0, \tau_1$, to generate all distinct, non-zero pairs of coprime, positive integers which we describe within the context of a binary tree which we denote $T$. While this…

Number Theory · Mathematics 2008-02-18 Brian A. Benson

We show that universal elliptic Carmichael numbers do not exist, answering a question of Silverman. Moreover, we show that the probability that an integer $n$, which is not a prime power, is an elliptic Carmichael number for a random curve…

Number Theory · Mathematics 2019-12-03 Jan-Christoph Schlage-Puchta

In this paper, we use the former of the authors developed theory of \emph{circles of partition} to investigate possibilities to prove the binary Goldbach and Lemoine conjectures. We state the \emph{squeeze principle} and its consequences…

Number Theory · Mathematics 2026-04-21 Theophilus Agama , Berndt Gensel

We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…

Combinatorics · Mathematics 2015-12-09 Cyril Banderier , Pawel Hitczenko

We express classical, free, Boolean and monotone cumulants in terms of each other, using combinatorics of heaps, pyramids, Tutte polynomials and permutations. We completely determine the coefficients of these formulas with the exception of…

Combinatorics · Mathematics 2019-07-29 Octavio Arizmendi , Takahiro Hasebe , Franz Lehner , Carlos Vargas

We give a closed-form expression for $\varphi(1+\varphi(2+\varphi(3+...+\varphi(n)$, where $\varphi$ is Euler's totient function. More generally, for an integer sequence $A=\{a_j\}$ we study the value of…

Number Theory · Mathematics 2025-01-22 Luis Palacios Vela , Christian Wolird

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

Number Theory · Mathematics 2025-07-15 Sara Moore , Jonathan P. Sorenson

Let $e_1,e_2,e_3$ be nonzero integers satisfying $e_1+e_2+e_3=0$. Let $(a,b,c)$ be a primitive triple of odd integers satisfying $e_1a^2+e_2b^2+e_3c^2=0$. Denote by $E: y^2=x(x-e_1)(x+e_2)$ and $\mathcal E: y^2=x(x-e_1a^2)(x+e_2b^2)$.…

Number Theory · Mathematics 2023-03-10 Shenxing Zhang

Let $n = b_1 + ... + b_k = b_1' + \cdot + b_k'$ be a pair of compositions of $n$ into $k$ positive parts. We say this pair is {\em irreducible} if there is no positive $j < k$ for which $b_1 + ... b_j = b_1' + ... b_j'$. The probability…

Combinatorics · Mathematics 2007-05-23 Edward A. Bender , Gregory F. Lawler , Robin Pemantle , Herbert S. Wilf

Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n\to\infty$ the probability of full connectivity is…

Probability · Mathematics 2016-04-07 Mathew D. Penrose