Related papers: Short Proof: Exact Solution to the Finite Frobeniu…
Coin-flipping is a fundamental cryptographic task where a spatially separated Alice and Bob wish to generate a fair coin-flip over a communication channel. It is known that ideal coin-flipping is impossible in both classical and quantum…
Let a and b be positive, relatively prime integers. We show that the following are equivalent: (i) d is a dead end in the (symmetric) Cayley graph of Z with respect to a and b, (ii) d is a Frobenius value with respect to a and b (it cannot…
Chowla's cosine problem concerns the largest minimum of an expression of the form $\cos a_1\theta + ... + \cos a_n\theta$ where the $a_i$ are distinct positive integers. We compute this largest minimum when $n$ is 2 or 3.
In this paper, we introduce and study the numerical semigroups generated by $\{a_1, a_2, \ldots \} \subset \mathbb{N}$ such that $a_1$ is the repunit number in base $b > 1$ of length $n > 1$ and $a_i - a_{i-1} = a\, b^{i-2},$ for every $i…
Goldbach conjecture is one of the most famous open mathematical problems. It states that every even number, bigger than two, can be presented as a sum of 2 prime numbers. % In this work we present a deep learning based model that predicts…
Complementarity problems often permit distinct solutions, a fact of major significance in optimization, game theory and other fields. In this paper, we develop a numerical technique for computing multiple isolated solutions of…
ApSimon's Mints problem is a very difficult and often misunderstood counterfeit-coin puzzle. I explain the problem and suggest ways to approach it, while giving several fun exercises for the reader.
We solve two long-standing open problems on word equations. Firstly, we prove that a one-variable word equation with constants has either at most three or an infinite number of solutions. The existence of such a bound had been conjectured,…
We determine all entire functions $f$ such that for nonzero complex values $a\neq b$ the implications $f=a \Rightarrow f' =a$ and $f' =b \Rightarrow f=b$ hold. This solves an open problem in uniqueness theory. In this context we give a…
The counterfeit coin problem requires us to find all false coins from a given bunch of coins using a balance scale. We assume that the balance scale gives us only ``balanced'' or ``tilted'' information and that we know the number k of false…
Let $A=(a_1, a_2, ..., a_n)$ be relative prime positive integers with $a_i\geq 2$. The Frobenius number $F(A)$ is the largest integer not belonging to the numerical semigroup $\langle A\rangle$ generated by $A$. The genus $g(A)$ is the…
This paper describes problems concerning the range of cardinalities of sumsets and restricted sumsets of finite subsets of the integers and finite subsets of ordered abelian groups.
We know that any prime number of form $4s+1$ can be written as a sum of two perfect square numbers. As a consequence of Goldbach's weak conjecture, any number great than $10$ can be represented as a sum of four primes. We are motivated to…
We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…
The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The second cuboid conjecture is one of the three propositions suggested as intermediate stages in proving the…
In the Colored Bin Packing problem a set of items with varying weights and colors must be packed into bins of uniform weight limit such that no two items of the same color may be packed adjacently within a bin. We solve this problem for the…
In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given…
In 2018, Luca and Patel conjectured that the largest perfect power representable as the sum of two Fibonacci numbers is $3864^2 = F_{36} + F_{12}$. In other words, they conjectured that the equation…
The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…
Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced? In the paper, we consider a succinct version of the question: given a set of…