There are no multiply-perfect Fibonacci numbers

Here, we show that no Fibonacci number (larger than 1) divides the sum of its divisors

Description of Euler bricks using Fibonacci's identity

We show how the Fibonacci's identity is used to obtain Euler bricks. Also,we put forward the relation between Fibonacci's identity and Euler's formula, which provides the description of Euler's bricks with noninteger spatial diagonal. Finally,we establish a relation between the Euler bricks with integer and noninteger spatial diagonals.Comment: 8 page

The problem of the pawns

In this paper we study the number $M_{m,n}$ of ways to place nonattacking pawns on an $m\times n$ chessboard. We find an upper bound for $M_{m,n}$ and analyse its asymptotic behavior. It turns out that $\lim_{m,n\to\infty}(M_{m,n})^{1/mn}$ exists and is bounded from above by $(1+\sqrt{5})/2$. Also, we consider a lower bound for $M_{m,n}$ by reducing this problem to that of tiling an $(m+1)\times (n+1)$ board with square tiles of size $1\times 1$ and $2\times 2$. Moreover, we use the transfer-matrix method to implement an algorithm that allows us to get an explicit formula for $M_{m,n}$ for given $m$.Comment: 16 pages; 6 figure