Related papers: Some Results on the Counterfeit Coins Problem II
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…
The change-making problem asks: given a positive integer $v$ and a collection $C$ of integer coin values $c_1=1<c_2< c_3< \cdots< c_n$, what is the minimum number of coins needed to represent $v$ with coin values from $C$? For some coin…
General considerations on the Equivalence conjectures and a review of few mathematical results.
The Ramanujan Machine project predicts new continued fraction representations of numbers expressed by important mathematical constants. Generally, the value of a continued fraction is found by reducing it to a second order linear difference…
We continue our recent work on averages for ternary additive problems with powers of prime numbers.
We take a fresh look at the classical problem of runs in a sequence of i.i.d.\ coin tosses and derive a general identity/recursion which can be used to compute (joint) distributions of functionals of run types. This generalizes and unifies…
In an earlier paper we introduced the notion of 'bifurcating continued fractions' in a heuristic manner. In this paper a formal theory is developed for the 'bifurcating continued fractions'.
An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generating Function G(x), where the coefficient of x^i is equal to…
Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…
We discuss the ACC conjecture and the LSC conjecture for minimal log discrepancies of generalized pairs. We prove that some known results on these two conjectures for usual pairs are still valid for generalized pairs. We also discuss the…
The main objective of this paper is to obtain some Gruss Like Inequalities using Pompeiu's mean value theorem on Conformable Fractional Calculus.
Some generalized multi-sum Chu-Vandermonde identities are presented and proved, generalizing some known multi-sum Chu-Vandermonde identities from literature and adding some quadratic and cubic examples of these identities. Some other…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
An elementary general result is proved that allows for simple characterizations of well-known location/consensus functions (median, mean and center) on the n-cube. In addition, alternate new characterizations are given for the median and…
We obtain some new results concerning the small deviation problem for $S=\sum_n q^n X_n$ and $M=\sup_n q^n X_n$, where $0<q<1$ and $(X_n)$ are i.i.d. non-negative random variables. In particular, the asymptotics is shown to be the same for…
We consider the problem of estimating the common time of a change in the mean parameters of panel data when dependence is allowed between the panels in the form of a common factor. A CUSUM type estimator is proposed, and we establish first…
In the paper, we generalize some congruences of Lehmer for general composite numbers.
We analyze the possible results of the most general measurement on two copies of a quantum state. We show that $\mu$ can label a set of outcomes of such measurement if and only if there is a family of completely co--positive (ccP) maps…
We consider the problem of estimating the number of types in a corpus using the number of types observed in a sample of tokens from that corpus. We derive exact and asymptotic distributions for the number of observed types, conditioned upon…
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…