# Thread:

1. ## Fibonacci numbers.

The Fibonacci numbers are defined by $F_0=0$, $F_1=1$ and $F_n=F_{n-1}+F_{n-2}$
Prove if $2|F_n$, then $3|n$

This is one of those times where it's easy to see intuitively, it's hard to see formally.
Considering the Fibonacci sequence
$0,1,1,2,3,5,8,13,21,36...$

It falls into a pattern of
$E,O,O,E,O,O,E,O,O,E,...$

From, as the first term $F_0$ is even, it's clear to see that every third term beginning from $F_1$ is divisible by 3, as it is the sum of the 2 previous numbers which are odd.

But this just scaffolding, scrap work.
Any tips on how to codify this formally?

2. Given the recursive nature of Fibonacci numbers, a proof by induction seems to be the logical way to go. Have you considered that?
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 9, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9608275890350342, "perplexity_flag": "head"}