English
Related papers

Related papers: On odd covering systems with distinct moduli

200 papers

In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…

Combinatorics · Mathematics 2016-09-05 Peter Frankl , Vojtech Rödl , Andrzej Ruciński

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

Number Theory · Mathematics 2026-05-22 Wujie Shi

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…

Number Theory · Mathematics 2026-05-12 Shouqiao Wang , Davide Crapis

Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…

Number Theory · Mathematics 2014-11-03 Liuquan Wang

Let $pod_2(n)$ denote the number of $2$-regular partitions of $n$ with distinct odd parts (even parts are unrestricted). In this article, we obtain congruences for $pod_2(n)$ mod $2$ and mod $8$ using some generating function manipulations…

Number Theory · Mathematics 2024-08-27 Hemjyoti Nath

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…

Combinatorics · Mathematics 2014-02-18 L. Sunil Chandran , Deepak Rajendraprasad , Nitin Singh

We prove that for each fixed $m \ge 2$, there are only finitely many disjoint covering systems with minimum modulus at least $3$ in which precisely one modulus is repeated, namely the largest modulus, and it occurs exactly $m$ times.

Number Theory · Mathematics 2026-03-30 Yu Hashimoto

We investigate the implications of a curious biconditional involving divisors of odd perfect numbers, if Dris conjecture that $q^k < n$ holds, where $q^k n^2$ is an odd perfect number with Euler prime $q$. We then show that this…

Number Theory · Mathematics 2018-01-12 Jose Arnaldo B. Dris

For integers a and n>0, let a(n) denote the residue class {x\in Z: x=a (mod n)}. Let A be a collection {a_s(n_s)}_{s=1}^k of finitely many residue classes such that A covers all the integers at least m times but {a_s(n_s)}_{s=1}^{k-1} does…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…

Number Theory · Mathematics 2019-03-01 Lee Troupe

We exhibit a new application of two dimensional covering systems, examples of integer pairs $a,b$ for which $a^m-b^n$ has a prime divisor from some given finite set of primes, for every pair of integers $m,n\geq 0$. This leads us to…

Number Theory · Mathematics 2026-04-14 Andrew Granville , Francesco Pappalardi

A famous conjecture of Parkin-Shanks predicts that $p(n)$ is odd with density $1/2$. Despite the remarkable amount of work of the last several decades, however, even showing this density is positive seems out of reach. In a 2018 paper with…

Combinatorics · Mathematics 2021-06-29 Fabrizio Zanello

Main Theorem: Spaces of r-branch point 3-cycle covers, degree n or Galois of degree n!/2 have one (resp. two) component(s) if r=n-1 (resp. r\ge n). Improves Fried-Serre on deciding when sphere covers with odd-order branching lift to…

Number Theory · Mathematics 2011-01-26 Michael D. Fried

An odd perfect number, N, is shown to have at least nine distinct prime factors. If 3 does not divide N, then N must have at least twelve distinct prime divisors. The proof ultimately avoids previous computational results for odd perfect…

Number Theory · Mathematics 2009-11-11 Pace P. Nielsen

Euler showed that if an odd perfect number exists, it must be of the form $N = p^\alpha q_{1}^{2\beta_{1}}$ $\ldots$ $q_{k}^{2\beta_{k}}$, where $p, q_{1}, \ldots, q_k$ are distinct odd primes, $\alpha$, $\beta_{i} \geq 1$, for $1 \leq i…

Number Theory · Mathematics 2015-12-07 Patrick Brown

We provide a way to modify and to extend a previously established inequality by P. Erd\H{o}s, R. Graham and others and to answer a conjecture posed in the nineties by R. Graham, which bears on the lack of divisibility of the central…

Number Theory · Mathematics 2010-10-18 Robert J Betts

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

Number Theory · Mathematics 2025-04-25 Jean-Paul Allouche , Manon Stipulanti , Jia-Yan Yao

For every finite group $H$ and every finite $H$-module $A$, we determine the subgroup of negligible classes in $H^2(H,A)$, in the sense of Serre, over fields with enough roots of unity. As a consequence, we show that for every odd prime…

Number Theory · Mathematics 2024-10-17 Alexander Merkurjev , Federico Scavia

Let $\overline{bt}(n)$ denote the number of overcubic partition triples of $n$. Nayaka, Dharmendra and Kumar proved some congruences modulo 8, 16 and 32 for $\overline{bt}(n)$. Recently, Saikia and Sarma established some congruences modulo…

Number Theory · Mathematics 2025-04-10 Jiayu Chen , Jing Jin , Olivia X. M. Yao

We prove a lifting theorem for odd Frattini covers of finite groups. Using this, we characterize solvable groups and more generally p-solvable groups in terms of containing a triple of elements of distinct prime power orders with product 1.…

Group Theory · Mathematics 2011-12-21 Robert Guralnick , Pham Huu Tiep