On the Parity of the Order of Appearance in the Fibonacci Sequence

Abstract

Let ${\left(F_n\right)}_{n\ge 0}$ be the Fibonacci sequence. The order of appearance function (in the Fibonacci sequence) $z:{\mathbb{Z}}_{\ge 1}\to {\mathbb{Z}}_{\ge 1}$ is defined as $z\left(n\right):=min\{k\ge 1:F_k\equiv 0(modn)\}$. In this paper, among other things, we prove that $z\left(n\right)$ is an even number for almost all positive integers n (i.e., the set of such n has natural density equal to 1).

1. Introduction

Let ${\left(F_n\right)}_n$ be the sequence of Fibonacci numbers which is defined by the recurrence $F_{n+2}=F_{n+1}+F_n$, with initial values $F_0=0$ and $F_1=1$. For any integer $n\ge 1$, the order of apparition (or the rank of appearance) of n (in the Fibonacci sequence), denoted by $z\left(n\right)$, is the positive index of the smallest Fibonacci number which is a multiple of n (more precisely, $z\left(n\right):=min\{k\ge 1:n\mid F_k\}$). The arithmetic function $z:{\mathbb{Z}}_{\ge 1}\to {\mathbb{Z}}_{\ge 1}$ is well defined (as can be seen in Lucas [1], p. 300) and, in fact, $z\left(n\right)\le 2n$ is the sharpest upper bound (as can be seen in [2]). A few values of $z\left(n\right)$ (for $n\in [1,50]$) can be found in

Table 1. Values of $z\left(n\right)$ for n from 1 to 50.

n	z(n)	n	z(n)	n	z(n)	n	z(n)	n	z(n)
1	1	11	10	21	8	31	30	41	20
2	3	12	12	22	30	32	24	42	24
3	4	13	7	23	24	33	20	43	44
4	6	14	24	24	12	34	9	44	30
5	5	15	20	25	25	35	40	45	60
6	12	16	12	26	21	36	12	46	24
7	8	17	9	27	36	37	19	47	16
8	6	18	12	28	24	38	18	48	12
9	12	19	18	29	14	39	28	49	56
10	15	20	30	30	60	40	30	50	75

(see the OEIS [3] sequence A001177 and for more facts on properties of $z\left(n\right)$ see, e.g., [4,5,6,7,8,9]).

Recall that the natural density of $\mathcal{A}\subseteq {\mathbb{Z}}_{>0}$ is the following limit (if it exists):

$${\displaystyle \delta \left(\mathcal{A}\right):=\underset{x\to \infty }{lim}\frac{\#\mathcal{A}\left(x\right)}{x},}$$

where $\mathcal{A}\left(x\right):=\mathcal{A}\cap [1,x]$ for $x>0$. In 2020, Trojovský [10] proved that natural density of the set $\{n\ge 1:z(n)<ϵn\}$ is 1, for all $ϵ>0$ (which generalized a result due to Marques [11] about $lim{inf}_{n\to \infty }z\left(n\right)/n$). Let $f:{\mathbb{Z}}_{\ge 1}\to {\mathbb{Z}}_{\ge 1}$ be an arithmetic function. We denote by ${\mathcal{E}}_f$ the set all n for which $f\left(n\right)$ is an even number (i.e., ${\mathcal{E}}_f:=\{n\ge 1:f\left(n\right)\equiv 0(mod2)\}$). For example, if $\varphi \left(n\right)$ and $d\left(n\right)$ are the Euler totient function and the number-of-divisors function, respectively, then ${\mathcal{E}}_{\varphi }={\mathbb{Z}}_{\ge 3}$ and ${\mathcal{E}}_d={\mathbb{Z}}_{\ge 1}\setminus \{n^2:n\ge 1\}$. In particular, both sets ${\mathcal{E}}_{\varphi }$ and ${\mathcal{E}}_d$ have natural density equal to 1. Another well-known arithmetic function related to Fibonacci numbers is the Pisano period $\pi :{\mathbb{Z}}_{\ge 1}\to {\mathbb{Z}}_{\ge 1}$ for which $\pi \left(n\right)$ is the smallest period of ${\left(F_k(modn)\right)}_k$. The first few values of $\pi \left(n\right)$ (for $n\in [1,50]$) are in

Table 2. Values of $\pi \left(n\right)$ for n from 1 to 50.

n	$\mathit{\pi }\left(\mathit{n}\right)$	n	$\mathit{\pi }\left(\mathit{n}\right)$	n	$\mathit{\pi }\left(\mathit{n}\right)$	n	$\mathit{\pi }\left(\mathit{n}\right)$	n	$\mathit{\pi }\left(\mathit{n}\right)$
1	1	11	10	21	16	31	30	41	40
2	3	12	24	22	30	32	48	42	48
3	8	13	28	23	48	33	40	43	88
4	6	14	48	24	24	34	36	44	30
5	20	15	40	25	100	35	80	45	120
6	24	16	24	26	84	36	24	46	48
7	16	17	36	27	72	37	76	47	32
8	12	18	24	28	48	38	18	48	24
9	24	19	18	29	14	39	56	49	112
10	60	20	60	30	120	40	60	50	300

(see sequence A001175 in OEIS):

Since $F_i=i$, for $i\in \{1,2\}$, the Pisano period may be defined as $\pi \left(n\right):=min\{k\ge 1:F_k\equiv 0(modn)\mathrm{and}{F}_{k+1}\equiv 1(modn)\}$. Thus, for $n\ge 3$, $\pi \left(n\right)$ is the order of the Fibonacci Q-matrix:

$$Q=\left(\begin{array}{cc}1& 1\\ 1& 0\end{array}\right)$$

in the general linear group $G{L}_2\left({\mathbb{Z}}_n\right)$ (i.e., the invertible $2\times 2$ matrices modulo n). In particular, $1=det\left(Q^{\pi \left(n\right)}\right)={(det\left(Q\right))}^{\pi \left(n\right)}={(-1)}^{\pi \left(n\right)}$, yielding that $\pi \left(n\right)$ is even, for all $n\ge 3$. In conclusion, ${\mathcal{E}}_{\pi }={\mathbb{Z}}_{\ge 3}$.

Observe that $\pi \left(n\right)$ and $z\left(n\right)$ have similar definitions (in fact, these functions are strongly connected, as can be seen in Lemma 3). However, they have very distinct behavior related to their parity. For example, ${\mathbb{Z}}_{\ge 1}\setminus {\mathcal{E}}_z$ is an infinite set (since $z\left(5^k\right)=5^k$ is an odd number, for all $k\ge 0$).

Therefore, the aim of this paper is to study some arithmetical and analytical properties of ${\mathcal{E}}_z:=\{n\ge 1:z\left(n\right)\equiv 0(mod2)\}$. Our first result provides three infinite arithmetic progressions belonging to this set. More precisely,

Theorem 1.

We have that $\{3n,4n-1,4n\}\subseteq {\mathcal{E}}_z$, for all $n\ge 1$.

Remark 1.

We remark that the arithmetic progressions of Theorem 1 are the largest ones (in the sense of natural density) belonging to ${\mathcal{E}}_z$. In fact, for other arithmetic progressions of density of at least $1/4$, we have infinitely many terms which are outside of ${\mathcal{E}}_z$. Some of these terms can be made explicit. For example:

• If $n=5^k$, then $z\left(2n\right)=3·5^k$, for all $k\ge 0$.
• If $n=(5^k-1)/2$, then $z(2n+1)=5^k$, for all $k\ge 0$.
• If $n=(5^{2k}-1)/3$, then $z(3n+1)=5^{2k}$, for all $k\ge 0$.
• If $n=(5^{2k+1}-2)/3$, then $z(3n+2)=5^{2k+1}$, for all $k\ge 0$.
• If $n=(5^k-1)/4$, then $z(4n+1)=5^k$, for all $k\ge 0$.
• If $n=(5^k-1)/2$, then $z(4n+2)=3·5^k$, for all $k\ge 0$.

We point out that Theorem 1 implies, in particular, that the natural density of ${\mathcal{E}}_z$ is at least $1/2$ (since ${(4n-1)}_n$ and ${\left(4n\right)}_n$ are disjoint arithmetic progressions with natural density equal to $1/4$). In fact, it is possible to obtain a better lower bound for $\delta \left({\mathcal{E}}_z\right)$, by noting that ${\mathcal{E}}_z$ also contains ${\left(3n\right)}_n$ which has density $1/3$. Since the last sequence is not disjoint from the previous ones, we may use the inclusion–exclusion principle to deduce that the natural density of ${\mathcal{E}}_z$ is at least

$$\frac{1}{4}+\frac{1}{4}+\frac{1}{3}-\frac{1}{12}-\frac{1}{12}=\frac{2}{3}\approx 0.66.$$

Table 3. Quantity and proportion of arguments for which $z\left(n\right)$ is even.

x	10	20	50	100	200	500	1000	3000
$\#{\mathcal{E}}_z\left(x\right)$	6	14	39	81	163	425	862	2632
$\frac{\#{\mathcal{E}}_z\left(x\right)}{x}$	0.6	0.7	0.78	0.81	0.815	0.85	0.862	0.877

suggests that for almost all positive integers n, one has that $z\left(n\right)$ is even (i.e., one expects that $\delta \left({\mathcal{E}}_z\right)=1$). Note that a sieve method of searching by arithmetic progressions lying in ${\mathcal{E}}_z$ does not seem to reach the value 1.

However, we were able to surmount this obstacle to confirm the expectation:

Theorem 2.

There exists an effective computable constant $c>0$ such that

$$\#{\mathcal{E}}_z\left(x\right)\ge x-{\displaystyle \frac{cx}{{(logx)}^{1/2}}},$$

for all $x>6.3\times {10}^{27}$. In particular, one has that $\delta \left({\mathcal{E}}_z\right)=1$.

Remark 2.

Note that all previously provided infinite sequences belonging to ${\mathbb{Z}}_{\ge 1}\setminus {\mathcal{E}}_z$ have exponential growth (e.g., ${\left(5^n\right)}_n)$. In fact, the previous theorem ensures, in particular, that no infinite arithmetic progression can be within ${\mathbb{Z}}_{\ge 1}\setminus {\mathcal{E}}_z$(since its natural density is $0)$.

The proof of the theorems combines Diophantine properties of $z\left(n\right)$ with analytical tools concerning primes in arithmetic progressions.

2. Auxiliary Results

In this section, we shall present some results which will be very important tools in the proof. The first ingredient is related to the value of $z\left(p^k\right)$, for a prime number p and $k\ge 1$:

Lemma 1

(Theorem 2.4 of [12]). We have that $z\left(2^k\right)=3·2^{k-1}$, for all $k\ge 2$, and $z\left(3^k\right)=4·3^{k-1}$, for all $k\ge 1$. In general, it holds that

$$z\left(p^k\right)=p^{max\{k-e(p),0\}}z\left(p\right),$$

where $e\left(p\right):=max\{k\ge 0:p^k\mid F_{z\left(p\right)}\}$.

The next result provides some divisibility properties of the Pisano period for prime numbers.

Lemma 2

(Theorem 2.2 of [12]). Let p be a prime number. We have that

(i)

If $p\equiv \pm 1(mod5)$, then $\pi \left(p\right)$ divides $p-1$.

(ii)

If $p\equiv \pm 2(mod5)$, then $\pi \left(p\right)$ divides $2(p+1)$. Furthermore, $\pi \left(p\right)=2(p+1)/t$, for some odd number t.

Observe that $F_{\pi \left(n\right)}\equiv F_0\equiv 0(modn)$ and then $z\left(n\right)$ divides $\pi \left(n\right)$. Our next tool provides a characterization of the quotient $\pi \left(n\right)/z\left(n\right)$. In fact,

Lemma 3

(Theorem 1 of [13]). We have that $\pi \left(n\right)/z\left(n\right)\in \{1,2,4\}$, for all $n\ge 1$. Moreover, $\pi \left(n\right)=4z\left(n\right)$ if and only if $z\left(n\right)$ is odd.

The next tool is a kind of “formula” for $z\left(n\right)$ depending on $z\left(p^a\right)$ for all primes p dividing n. The proof of this fact can be found in [14].

Lemma 4

(Theorem 3.3 of [14]). Let $n>1$ be an integer with prime factorization $n=p_1^{a_1}\cdots p_k^{a_k}$. Then

$$z\left(n\right)=lcm(z\left(p_1^{a_1}\right),\dots ,z\left(p_k^{a_k}\right)).$$

In general, it holds that

$$z\left(lcm(m_1,\dots ,m_k)\right)=lcm(z\left(m_1\right),\dots ,z\left(m_k\right)).$$

In order to prove Theorem 2, we need an analytic tool related to the profusion of integers having factorization allowing only some classes of primes. The following notation will be used throughout this work: let $\mathbb{P}$ be the set of prime numbers and for an integer $q\ge 2$, set $\mathbb{P}(a,q)$ as the set of all prime numbers of the form $a+kq$, for some integer $k\ge 0$ (Dirichlet’s theorem on arithmetic progressions) that ensures that $\mathbb{P}(a,q)$ is an infinite set whenever $gcd(a,q)=1$). Let ${\mathcal{N}}_{a,q}=\{n\ge 1:p\mid n\Rightarrow p\in \mathbb{P}(a,q)\}$ be the set of all positive integers whose prime factors lie exclusively in $\mathbb{P}(a,q)$. Additionally, denote $\beta :=1/\varphi \left(q\right)$ and

$$G_{a,b}\left(s\right):=\zeta {\left(s\right)}^{-\beta }\prod _{p\in \mathbb{P}(a,q)}{(1-p^{-s})}^{-1},$$

which has an analytic continuation to a neighborhood of $s=1$. Here, as usual, $\zeta \left(s\right)$ denotes the Riemann zeta function.

Our last auxiliary lemma is a particular case of a theorem due to Chang and Martin [15]. We state this more precisely in the next lemma.

Lemma 5

(Theorem 3.4 of [15]). For any integer $q\ge 3$, there exists a positive absolute constant C such that uniformly for $q\le {(logx)}^{1/3}$, we have

$$\#\{n\le x:n\in {\mathcal{N}}_{a,q}\}={\displaystyle \frac{x}{{(logx)}^{1-\beta }}}\left({\displaystyle \frac{G_{a,q}\left(1\right)}{\mathsf{\Gamma }\left(\beta \right)}}+O\left(C{(logx)}^{-1/4}\right)\right),$$

(1)

where $\mathsf{\Gamma }\left(z\right)={\int }_0^{\infty }{t}^{z-1}{e}^{-t}dt$ is the Gamma function.

Now, we are ready to deal with the proof of the theorems.

3. The Proofs

3.1. The Proof of Theorem 1

• The Case $z\left(3n\right)$

Proof. 

First, in order to use Lemma 4, one may write $n=3^{k}m$, where $k\ge 0$ and $gcd(m,3)=1$. So, Lemma 4 yields that

$$z\left(3n\right)=z\left(3^{k+1}m\right)=\mathrm{lcm}(z\left(3^{k+1}\right),z\left(m\right))=\mathrm{lcm}(4·3^k,z\left(m\right)),$$

where we used Lemma 1. Hence we deduce that 4 divides $z\left(3n\right)$. □

• The Case $z\left(4n\right)$

Proof. 

Let us write $n=2^{k}m$, where m is odd and $k\ge 0$. Thus, by Lemma 4, we have

$$z\left(4n\right)=z\left(2^{k+2}m\right)=\mathrm{lcm}(z\left(2^{k+2}\right),z\left(m\right))=\mathrm{lcm}(3·2^{k+1},z\left(m\right)),$$

where we used Lemma 1. Since $k+1\ge 1$, then 2 divides $\mathrm{lcm}(3·2^{k+1},z\left(m\right))=z\left(4n\right)$, as desired. □

• The Case $z(4n+3)$

This case is more delicate, since $4n+3$ is a prime number for infinitely many values of n. To overcome this difficulty, we deal first with these prime values.

Claim 1.

If $p=4k+3$ is a prime number, then $z\left(p\right)$ is even. The proof splits into two cases concerning the residues of p modulo 5. In fact, if $p\equiv \pm 1(mod5)$, then Lemma 2 (i) implies that $\pi \left(p\right)$ divides $p-1$. Striving for a contradiction, suppose that $z\left(p\right)$ is odd. Then, by Lemma 3, we have that $\pi \left(p\right)=4z\left(p\right)$ leading to the absurdity that $4z\left(p\right)$ divides $p-1=4n+2$. Thus, $z\left(p\right)$ is an even number. Now, for the case in which $p\equiv \pm 2(mod5)$, one has, by Lemma 2 (ii), that $\pi \left(p\right)=2(p+1)/t$, for some odd integer t. Thus, by Lemma 3, we obtain

$$2^{i}z\left(p\right)=\pi \left(p\right)=\frac{2(p+1)}{t}=\frac{8(n+1)}{t},$$

for some $i\in \{0,1,2\}$. Thus, $z\left(p\right)=2^{3-i}(n+1)/t$ is an even number, since $3-i\ge 1$ and $t\equiv 1(mod2)$. This finishes the proof of the claim.

Proof. 

Let $4n+3=p_1^{a_1}\cdots p_k^{a_k}$ be the prime factorization of the composite number $4n+3$, with $a_i\ge 1$. By Lemma 4, we obtain

$$z(4n+3)=\mathrm{lcm}(z\left(p_1^{a_1}\right),\dots ,z\left(p_k^{a_k}\right)).$$

(2)

Since the product of numbers $\equiv 1(mod4)$ is also $\equiv 1(mod4)$, then at least one of the prime factors of $4n+3$, say $p_1$, must be of the form $4\ell +3$. Therefore, by Lemma 1, we can rewrite (2) as

$$z(4n+3)=\mathrm{lcm}(p_1^{max\{a_1-e\left(p_1\right),0\}}z\left(p_1\right),\dots ,z\left(p_k^{a_k}\right)).$$

However, $p_1=4\ell +3$ is a prime number and the previous claim implies that $z\left(p_1\right)$ is even and so is $z(4n+3)$ (since $z\left(p_1\right)$ divides $z(4n+3)$). This completes the proof. □

3.2. The Proof of Theorem 2

Proof. 

We have that

$$\#{\mathcal{E}}_z\left(x\right)=\#\{n\le x:z\left(n\right)\equiv 0(mod2)\}.$$

Note that since $z\left(n\right)$ is a multiple of $z\left(p\right)$, for all prime p in the factorization of n (by Lemma 4), then a sufficient condition for $z\left(n\right)$ to be even is for n to have some prime factor of the form $4k+3$ (since $z(4k+3)$ is even, by Theorem 1). Therefore,

$$\begin{array}{ccc}\hfill \#{\mathcal{E}}_z\left(x\right)& =& \#\{n\le x:z(n)\in 2\mathbb{Z}\}\hfill \\ & \ge & \#\{n\le x:\exists p\mid n\mathrm{with}p\equiv 3(mod4\left)\right\}\hfill \\ & =& x-\#\{n\le x:p\mid n\Rightarrow p\equiv 1(mod4\left)\right\}.\hfill \end{array}$$

(3)

Since

$$\{n\le x:p\mid n\Rightarrow p\equiv 1(mod4)\}=\{n\le x:x\in {\mathcal{N}}_{1,4}\},$$

(4)

we can apply Lemma 5 in order to get an upper bound for the cardinality of the previous set. Thus, Lemma 5 (for $\beta =1/\varphi \left(4\right)=1/2$) implies the existence of a positive absolute constant C such that

$$\#\{n\le x:n\in {\mathcal{N}}_{1,4}\}={\displaystyle \frac{x}{{(logx)}^{1/2}}}\left({\displaystyle \frac{G_{1,4}\left(1\right)}{\sqrt{\pi }}}+O\left(C{(logx)}^{-1/4}\right)\right),$$

(5)

for all $x\ge e^{64}\approx 6.2\times {10}^{27}$ (where we used that $\mathsf{\Gamma }(1/2)=\sqrt{\pi }$). Moreover, we have that

$$G_{1,4}\left(s\right):=\zeta {\left(s\right)}^{-1/2}\prod _{p\in \mathbb{P}(1,4)}{(1-p^{-s})}^{-1}$$

(6)

and

$$G_{3,4}\left(s\right):=\zeta {\left(s\right)}^{-1/2}\prod _{p\in \mathbb{P}(3,4)}{(1-p^{-s})}^{-1}.$$

(7)

Since both sets $\mathbb{P}(1,4)$ and $\mathbb{P}(3,4)$ have the same density inside the set of all primes (namely, $1/2$), then $G_{1,4}\left(s\right)\asymp G_{3,4}\left(s\right)$ (i.e., $G_{1,4}\left(s\right)\ll G_{3,4}\left(s\right)$ and $G_{3,4}\left(s\right)\ll G_{1,4}\left(s\right)$). Now, we multiply (6) and (7) to arrive at

$$\begin{array}{ccc}\hfill G_{1,4}\left(s\right)G_{3,4}\left(s\right)& =& \zeta {\left(s\right)}^{-1}\left(\prod _{p\in \mathbb{P}(1,4)}{(1-p^{-s})}^{-1}\right)·\left(\prod _{p\in \mathbb{P}(3,4)}{(1-p^{-s})}^{-1}\right)\hfill \\ & =& \zeta {\left(s\right)}^{-1}\prod _{p\in \mathbb{P}(1,2)}{(1-p^{-s})}^{-1}\hfill \\ & =& \left(\prod _{p\in \mathbb{P}}(1-p^{-s})\right)·\left(\prod _{p\in \mathbb{P}(1,2)}{(1-p^{-s})}^{-1}\right)\hfill \\ & =& 1-{\displaystyle \frac{1}{2^s}},\hfill \end{array}$$

where we used the Euler product $\zeta \left(s\right)={\prod }_{p\in \mathbb{P}}{(1-p^{-s})}^{-1}$ (see [16], p. 39) and that $\mathbb{P}(1,2)=\mathbb{P}\setminus \left\{2\right\}$. In particular, we have that $G_{1,4}\left(1\right)G_{3,4}\left(1\right)=1/2$ and so $G_{1,4}\left(1\right)=O\left(1\right)$. Therefore, there exists a positive constant c such that (5) becomes

$$\#\{n\le x:n\in {\mathcal{N}}_{1,4}\}\le {\displaystyle \frac{cx}{{(logx)}^{1/2}}}.$$

(8)

Finally, we deduce by combining (3), (4), and (8) that

$$\#{\mathcal{E}}_z\left(x\right)\ge x-{\displaystyle \frac{cx}{{(logx)}^{1/2}}}$$

holds for all $x>6.3·{10}^{27}>e^{64}$.

Additionally, since

$$1\ge \delta \left({\mathcal{E}}_z\right)=\underset{x\to \infty }{lim}{\displaystyle \frac{\#{\mathcal{E}}_z\left(x\right)}{x}}\ge \underset{x\to \infty }{lim}\left(1-{\displaystyle \frac{c}{{(logx)}^{1/2}}}\right)=1,$$

we obtain that the natural density of ${\mathcal{E}}_z$ is equal to 1. The proof is then complete. □

4. Further Comments

We close this paper by offering one conjecture and two questions for further research. The natural generalization of the study presented in this work is to consider a similar problem by replacing 2 with another positive integer. For example, is $z\left(n\right)$ a multiple of 4, for almost all positive integers n?

To study this problem, we start by defining (for an integer $m\ge 2$) ${\mathcal{E}}_z^{\left(m\right)}$ as the set of all $n\in {\mathbb{Z}}_{\ge 1}$ for which $z\left(n\right)$ is a multiple of m (i.e., ${\mathcal{E}}_z^{\left(m\right)}:=\{n\ge 1:z\left(n\right)\equiv 0(modm)\}$). In particular, ${\mathcal{E}}_z^{\left(2\right)}={\mathcal{E}}_z$ and, by Theorem 2, one has that almost all positive integers belong to ${\mathcal{E}}_z^{\left(2\right)}$.

Note that, by Lemma 4, $z\left(p\right)$ divides $z\left(m\right)$ whenever p divides m. In particular,

$$\#{\mathcal{E}}_z^{\left(z\right(p\left)\right)}\left(x\right)\ge \frac{x}{p}$$

yielding that the natural density of ${\mathcal{E}}_z^{\left(z\right(p\left)\right)}$ is at least $1/p$. In the case in which $p=3$, we infer that $\delta \left({\mathcal{E}}_z^{\left(4\right)}\right)\ge 1/3$ (observe that $z\left(3\right)=4$). Moreover, we believe that

Conjecture 1.

The natural density of ${\mathcal{E}}_z^{\left(4\right)}$ is equal to 1.

The main difficulty in proving the last statement is to find some infinite arithmetic progression (containing infinitely many prime numbers) lying completely in ${\mathcal{E}}_z^{\left(4\right)}$ (in the spirit of Theorem 1). In general, we conclude by posing the following questions:

Question 1.

Are there infinitely many prime numbers p, for which $\delta \left({\mathcal{E}}_z^{\left(p\right)}\right)=1$?

Question 2.

Let $m\ge 1$ be an integer. Is it possible to provide an explicit positive lower bound for $\#{\mathcal{E}}_z^{\left(m\right)}\left(x\right)$?

5. Conclusions

In this paper, we study a Diophantine problem related to the arithmetic function $z:{\mathbb{Z}}_{\ge 1}\to {\mathbb{Z}}_{\ge 1}$, defined as $z\left(n\right):=min\{k\ge 1:n\mid F_k\}$ (the so-called order of appearance in the Fibonacci sequence). The problem is to establish some properties of ${\mathcal{E}}_z:=\{n\ge 1:2\mid z\left(n\right)\}$. Indeed, we provide three infinite arithmetic progressions lying entirely within ${\mathcal{E}}_z$ (which implies, in particular, that the natural density of ${\mathcal{E}}_z$ is at least $2/3$). Furthermore, we provide a lower bound for $\#({\mathcal{E}}_z\cap [1,x])$ (for all sufficiently large x) which, in particular, confirms the expectation: the natural density of ${\mathcal{E}}_z$ is 1. We close the work with some comments, questions, and a conjecture for further research. The proof combines arithmetical and analytical tools in number theory.