Related papers: 9 Divides no Odd Fibonacci

Let $\mathrm{pod}_{-3}(n)$ denote the number of partition triples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-3}(n)$ involving the following infinite family of…

Let $F_n$ denote the $n$-th Fibonacci number and $L_n$ the $n$-th Lucas number. We completely solve the family of cubic Thue equations $${(X-F_nY)(X-L_nY)X-Y^3=\pm1}$$ and show that there are no non-trivial solutions for $n\neq 1,3$.

We continue our study on relationships between Bernoulli polynomials and balancing (Lucas-balancing) polynomials. From these polynomial relations, we deduce new combinatorial identities with Fibonacci (Lucas) and Bernoulli numbers.…

Natural numbers divisible by the same prime factor lie on defined spiral graphs which are running through the Square Root Spiral (also named as the Spiral of Theodorus or Wurzel Spirale or Einstein Spiral). Prime Numbers also clearly…

We shall show that 2 and 9 are the only biunitary superperfect numbers.

In this paper we provide a straightforward proof that if a pair of amicable numbers with different parity exists (one number odd and the other one even), then the odd amicable number must be a perfect square, while the even amicable number…

We prove that nine-dimensional exceptional quotient singularities exist.

We prove that a positive integer $n$ is a Fibonacci number of even index if and only if $\langle n\varphi\rangle+\frac{1}{n}>1$.

Let $\mathcal{A}$ be the set of all integers of the form $\gcd(n, F_n)$, where $n$ is a positive integer and $F_n$ denotes the $n$th Fibonacci number. We prove that $\#\left(\mathcal{A} \cap [1, x]\right) \gg x / \log x$ for all $x \geq 2$,…

Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the…

In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…

We investigate some arithmetic properties of the q-Fibonacci numbers and the q-Pell numbers.

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.

We study $B(n;k)$, the number of ways of writing $n$ as a sum or difference of the first $k$ Fibonacci numbers. We show that $B(0;k)$ satisfies the Tribonacci-like recurrence $B(0;k+1)=B(0;k)+B(0;k-1)+B(0;k-2)$ and that $B(n;k)$ satisfies a…

In this paper we prove non-existence of nontrivial partial difference sets in Abelian groups of order 8p^3, where p \geq 3 is a prime number.

In this paper, we find all integers $c$ having at least two representations as a difference between a Fibonacci number and a Tribonacci number.

We prove an exact formula for OEIS A000119, which counts partitions into distinct Fibonacci numbers. We also establish an exact formula for its mean value, and determine the asymptotic behaviour.

This note contains a report of a proof by computer that the Fibonacci group F(2,9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that…

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…