Related papers: Arndt and De Morgan Integer Compositions
The mathematics of musical intervals and scales has been extensively studied. Vastly simplified, our ears seem to prefer intervals whose frequency ratios have small numerator and denominator, such as 2:1 (octave), 3:2 (perfect fifth), 4:3…
The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…
We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…
We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…
One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an arithmetic progression. Around 25 years ago, Gowers proved the…
An interesting characterization of the Fibonacci numbers is that, if we write them as $F_1 = 1$, $F_2 = 2$, $F_3 = 3$, $F_4 = 5, ...$, then every positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers. This is…
We prove multiplicative congruences mod $2^{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(n)$, the number of partitions of $n$ in which every even part is less than each odd part and only the largest even part…
A desarrangement is a permutation whose first ascent is even. Desarrangements were introduced in the 1980s by Jacques D\'{e}sarm\'{e}nien, who proved that they are in bijection with derangements. We revisit the study of desarrangements,…
Carlitz-compositions follow the restrictions of neighbouring parts $\sigma_{i-1}\neq\sigma_{i}$. The recently introduced Arndt-compositions have to satisfy $\sigma_{2i-1}>\sigma_{2i}$. The two concepts are combined to new and exciting…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…
We use elementary methods to establish three key recurrence relations: one for derangement numbers, a second for harmonic numbers, and a third for degenerate harmonic numbers. Our results not only contribute to the understanding of the…
We apply the Desnanot-Jacobi identity to give an alternative proof of the determinants whose entries are rising powers of the Fibonacci numbers given by Prodinger. We then generalize the determinants to include entries that are rising…
In this paper we present a recurrent relation for counting meaningful compositions of the higher-order differential operations on the space $R^{n}$ (n=3,4,...) and extract the non-trivial compositions of order higher than two.
Hirschhorn and Sellers studied arithmetic properties of the number of partitions with odd parts distinct. In another direction, Hammond and Lewis investigated arithmetic properties of the number of bipartitions. In this paper, we consider…
The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…
The notion of abundance of certain type of configuration in certain large sets was first proved by Furstenberg and Glazner in 1998. After that many author investigate abundance of different types of configurations in different types of…
We disprove a 2002 conjecture of Dombi from additive number theory. More precisely, we find examples of sets $A \subset \mathbb{N}$ with the property that $\mathbb{N} \setminus A$ is infinite, but the sequence $n \rightarrow |\{ (a,b,c) \,…
The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…
This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…