Related papers: How many ways can you make change: Some easy proof…
We continue the exploration of a question of dice relabeling posed by Gallian and Rusin: Given $n$ dice, each labeled 1 through $m$, how many ways are there to relabel the dice without changing the frequencies of the possible sums? We…
In this article, we try to explain and unify standard divisibility tests found in various books. We then look at recurring decimals, and list a few of their properties. We show how to compute the number of digits in the recurring part of…
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…
In quantitative finance, it is often necessary to analyze the distribution of the sum of specific functions of observed values at discrete points of an underlying process. Examples include the probability density function, the hedging…
A theoretical self-sustainable economic model is established based on the fundamental factors of production, consumption, reservation and reinvestment, where currency is set as a unconditional credit symbol serving as transaction equivalent…
The paper considers urn schemes in which several urns can be involved. Simplified formulas are proposed that allow direct calculation of probabilities without the use of elements combinatorics.
Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating…
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
We present a formula for the number of line segments connecting q+1 points of an n_1 x...x n_k rectangular grid. As corollaries, we obtain formulas for the number of lines through at least q points and, respectively, through exactly q…
In this paper, we will present some results on the counterfeit coins problem in the case of multi-sets.
This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly…
We present identities for permutations with fixed points. The formulas are based on successive derivations or integrations of the determinant of a particular matrix.
Given a sequence of numbers $\{p_n\}$ in $[0,1]$, consider the following experiment. First, we flip a fair coin and then, at step $n$, we turn the coin over to the other side with probability $p_n$, $n\ge 2$. What can we say about the…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…
We describe a simple Monte Carlo method for estimating $\pi$ by tossing a coin. Although the underlying Catalan-number series identities appear implicitly in the probability theory literature, the interpretation of $\frac{\pi}{4}$ presented…
Assuming that the two integrals in the Change of Variable Formula for the Riemann integral on the real line are finite, one can rightfully ask if they have equal value. We give a positive answer to this question. The proof is very easy to…
The time dependence of the currency exchange rate K treated as a function of national dividend, investments and difference between total demand for a goods and supply is considered. To do this a proposed earlier general algorithm of…
Finite differences have been widely used in mathematical theory as well as in scientific and engineering computations. These concepts are constantly mentioned in calculus. Most frequently-used difference formulas provide excellent…
We show how to simulate a roll of a fair $n$-sided die by one flip of a biased coin with probability $1/n$ of coming up heads, followed by $3\lfloor\log_2 n \rfloor+1$ flips of a fair coin.