Related papers: Unbounded discrepancy in Frobenius numbers

Let $0<\lambda\leq1$, $\lambda\notin\left\{\frac24, \frac27, \frac2{10}, \frac2{13}, \ldots\right\}$, be a real and $p$ a prime number, with $[p,p+\lambda p]$ containing at least two primes. Denote by $f_\lambda(p)$ the largest integer…

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…

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…

It turns out that all instances of the diophantine Frobenius problem for three coprime a_i have a common geometric structure which is independent of arithmetic coincidences among the a_i. By exploiting this structure we easily obtain…

A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…

Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a…

We obtain explicit forms of the current best known asymptotic upper bounds for gaps between squarefree integers. In particular we show, for any $x \ge 2$, that every interval of the form $(x, x + 11x^{1/5}\log x]$ contains a squarefree…

Let $P^+(n)$ denote the largest prime of the integer $n$. Using the \begin{align*}\Psi\_{F\_1\cdots F\_t}\left(\mathcal{K}\cap[-N,N]^d,N^{1/u}\right):=\\#\left\{\mathcal{K}\in…

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

Let $p_1=2, p_2=3, p_3=5, \ldots$ be the consecutive prime numbers, $S_n$ the numerical semigroup generated by the primes not less than $p_n$ and $u_n$ the largest irredundant generator of $S_n$. We will show, that $\bullet$ $u_n\sim3p_n$.…

In this paper we prove several inequalities for binomial coefficients. For instance, if $ k$ and $n$ are positive integers such that $n\ge 400$ and $[\frac n5]\le k\le [\frac n2]$, where $[x]$ is the greatest integer not exceeding $x$, then…

By applying the Euler--Rayleigh methods to a specific representation of the Jacobi polynomials as hypergeometric functions, we obtain new bounds for their largest zeros. In particular, we derive upper and lower bound for…

An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

For any $n$ and $k$, we provide an explicit (that is, computable in polynomial time) example of integer $B_k$-sequence of size $n$ consisting of elements bounded by $n^{k+o(k)}$.

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,…

Let $g(f)$ denote the maximum of the differences (gaps) between two consecutive exponents occurring in a polynomial $f$. Let $\Phi_n$ denote the $n$-th cyclotomic polynomial and let $\Psi_n$ denote the $n$-th inverse cyclotomic polynomial.…

Let $K$ be a set of positive integers and let $G$ be an additive group. A $(G, K, 1)$ difference packing is a set of subsets of $G$ with sizes from $K$ whose list of differences covers every element of $G$ at most once. It is balanced if…

Two words have a reverse if they have the same pair of distinct letters on the same pair of positions, but in reversed order. A set of words no two of which have a reverse is said to be reverse-free. Let F(n,k) be the maximum size of a…

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…