Related papers: Bounds on generalized Frobenius numbers

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius…

We consider sets of positive integers containing no sum of two elements in the set and also no product of two elements. We show that the upper density of such a set is strictly smaller than 1/2 and that this is best possible. Further, we…

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…

We establish upper bounds on the size of the largest subset of $\{1,2,\dots,N\}$ lacking nonzero differences of the form $h(p_1,\dots,p_{\ell})$, where $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ is a fixed polynomial satisfying appropriate…

Suppose that R is a two-dimensional normal standard-graded domain over a finite field. We prove that there exists a uniform Frobenius test exponent b for the class of homogeneous ideals in R generated by at most n elements. This means that…

A $\textit{square-full}$ number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form $f(n)$ for $n\leqslant N$ is denoted by…

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can…

Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…

We define $g(n)$ to be the maximal order of an element of the symmetric group on $n$ elements. Results about the prime factorization of $g(n)$ allow a reduction of the upper bound on the largest prime divisor of $g(n)$ to $1.328\sqrt{n\log…

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…

We establish two new Waring--Goldbach type representations: every sufficiently large odd integer $n$ can be expressed as \[ n = p_1^2 + p_2^2 + p_3^3 + p_4^3 + p_5^5 + p_6^6 + p_7^c, \] where each $p_i$ is prime and $c \in \{6,7\}$.

For $m\geq 1$, let $0<b_0<b_1<...<b_m$ and $\ e_0,e_1,...,e_m>0$ be fixed positive integers. Assume there exists a prime $p$ and an integer $t>0$ such that $p^t\mid b_0$, but $p^t\nmid b_{i}\ {\rm for}\ 1\leq i\leq m$. Then, we prove that…

Let $a,b$ be positive integers. In this note, we study the numerical semigroup $H=\left<a,a+1,b\right>$ and and the associated numerical semigroup ring $R=k[[H]]$. Under the certain conditions, we provide explicit formulas for the Frobenius…

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

A finite set $A$ of integers is square-sum-free if there is no subset of $A$ sums up to a square. In 1986, Erd\H os posed the problem of determining the largest cardinality of a square-sum-free subset of $\{1, ..., n \}$. Answering this…

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…