English
Related papers

Related papers: A remark on relatively prime sets

200 papers

Let $A$ be a set of positive integers. We define a positive integer $n$ as an $A$-practical number if every positive integer from the set $\left\{1,\ldots ,\sum_{d\in A, d\mid n}d\right\}$ can be written as a sum of distinct divisors of $n$…

Number Theory · Mathematics 2024-05-29 Andrzej Kukla , Piotr Miska

Based on the definition of generalized partially bent functions, using the theory of linear transformation, the relationship among generalized partially bent functions over ring Z N, generalized bent functions over ring Z N and affine…

Cryptography and Security · Computer Science 2007-05-23 Jianqin Zhou

We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…

Number Theory · Mathematics 2017-10-24 Kummari Mallesham

For a finite set $A\subseteq \mathbb{Z}$, the $h$-fold sumset is $hA :=\{x_1+\dots+x_h:x_i\in A\}$. We interpret the beginning of the sequence of sumset sizes $(|hA|)_{h=1}^\infty$ in terms of the successive $L^1$-minima of a lattice…

Number Theory · Mathematics 2025-08-19 Kevin O'Bryant

The usual goal of supervised learning is to find the best model, the one that optimizes a particular performance measure. However, what if the explanation provided by this model is completely different from another model and different again…

Machine Learning · Statistics 2024-09-11 Przemyslaw Biecek , Hubert Baniecki , Mateusz Krzyzinski , Dianne Cook

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

Number Theory · Mathematics 2025-04-14 Daniel R. Johnston , Valeriia V. Starichkova

We discuss some aspects of approximating functions on high-dimensional data sets with additive functions or ANOVA decompositions, that is, sums of functions depending on fewer variables each. It is seen that under appropriate smoothness…

Data Structures and Algorithms · Computer Science 2009-11-17 Markus Hegland , Vladimir Pestov

Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.

Group Theory · Mathematics 2017-02-10 Bettina Eick

The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…

Logic · Mathematics 2023-12-19 Kateřina Trlifajová

We define $\overline{\psi}$ to be the multiplicative arithemtic function that satisfies \[\overline{\psi}(p^{\alpha})=\begin{cases} p^{\alpha-1}(p+1), & \mbox{if } p\neq 2; \\ p^{\alpha-1}, & \mbox{if } p=2 \end{cases}\] for all primes $p$…

Number Theory · Mathematics 2015-01-08 Colin Defant

We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$

Group Theory · Mathematics 2018-09-05 Paul Bradley

Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related $k$-tuple analogs of the first and second Chebyshev functions are then defined.

Number Theory · Mathematics 2014-06-24 J. LaChapelle

Formula for the nth prime using elementary arithmetical functions based in a previous formula changing the characteristic function of prime numbers.

General Mathematics · Mathematics 2007-05-23 Sebastian Martin Ruiz

Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.

Number Theory · Mathematics 2024-03-19 Thomas Wright

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…

Number Theory · Mathematics 2022-11-29 Petr Kucheriaviy

In this paper, we consider properties of coefficients of a generating functions composition, where the outer function is a logarithmic generating function and the inner function is an ordinary generating function with integer coefficients.…

Combinatorics · Mathematics 2015-06-22 Dmitry Kruchinin , Yuriy Shablya

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…

Number Theory · Mathematics 2025-10-20 Johnathan Cai , Ryan Diehl , William Gasarch , Ian Kim , Rohan Sinha

Let X be a countably infinite set of real numbers and let Y_x, x \in X, be an independent family of stationary random subsets of the real numbers, e.g. homogeneous Poisson point processes. We give criteria for the a.s. existence of various…

Probability · Mathematics 2011-05-17 Martin P. W. Zerner

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

Number Theory · Mathematics 2020-12-08 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini