相关论文: Fibonacci Rectangles
Two very fast and simple O(lg n) algorithms for individual Fibonacci numbers are given and compared to competing algorithms. A simple O(lg n) recursion is derived that can also be applied to Lucas. A formula is given to estimate the largest…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then…
We prove that one can cover the $1 \times b$ rectangle by equal squares on both sides in one layer iff $b = p \pm \sqrt{p^2 - r^2} $, where $p \ge r \ge 0$ and $p,q \in \mathbb{Q}$.
We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…
In mathematics, a dissection of a square (or rectangle) into non-congruent rectangles is a Mondrian partition. If all the rectangles have the same area, it is called a perfect Mondrian partition. In this paper, we present a computational…
In this study, the properties of convex pentagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the rotationally symmetric tilings are formed by concave octagons that are generated by two convex pentagons…
We study multiplicative inequalities among entries of Lorentzian matrices, referred to as bounded ratios. These inequalities can be viewed as generalizations of the classical Alexandrov--Fenchel inequalities for mixed volumes. Our main…
A well known theorem of Lagrange states that the simple continued fraction of a real number $\alpha$ is periodic if and only if $\alpha$ is a quadratic irrational. We examine non-periodic and non-simple continued fractions formed by two…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
Starting from divisibility problem for Fibonacci numbers we introduce Fibonacci divisors, related hierarchy of Golden derivatives in powers of the Golden Ratio and develop corresponding quantum calculus. By this calculus, the infinite…
It is a $300$ year old counterintuitive observation of Prince Rupert of Rhine that in cube a straight tunnel can be cut, through which a second congruent cube can be passed. Hundred years later P. Nieuwland generalized Rupert's problem and…
Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The…
The Fibonacci cube of dimension n, denoted as $\Gamma\_n$, is the subgraph of the hypercube induced by vertices with no consecutive 1's. The irregularity of a graph G is the sum of |d(x)-d(y)| over all edges {x,y} of G. In two recent paper…
On each nonorientable surface of odd genus $g \geq 5$, we give a mapping class whose dilatation on an invariant subsurface is the golden ratio.
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…
We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…
In the present popular science paper we determine when a square can be dissected into rectangles similar to a given rectangle. The approach to the question is based on a physical interpretation using electrical networks. Only secondary…
We give a formula for the number of lozenge tilings of a hexagon on the triangular lattice with unit triangles removed from arbitrary positions along two non-adjacent, non-opposite sides. Our formula implies that for certain families of…
For every nonnegative integer $n$, let $r_F(n)$ be the number of ways to write $n$ as a sum of Fibonacci numbers, where the order of the summands does not matter. Moreover, for all positive integers $p$ and $N$, let \begin{equation*}…