Fibonacci numbers. how to prove? [duplicate]












-2












$begingroup$



This question already has an answer here:




  • Fibonacci modular results $ F_nmid F_{kn},,$ $, gcd(F_n,F_m) = F_{gcd(n,m)}$

    5 answers




We are give Fibonacci numbers.{fi
| i ∈ N}, where f0 = 0, f1 = 1, fn+2 = fn +fn+1, n∈ N. How to proof with mathematical induction that if n divides by m, then fn divides by fm?
I am having trouble with thinking, what should be the transition.






induction divisibility fibonacci-numbers







share|cite|improve this question











$endgroup$



marked as duplicate by anomaly, Crostul, amWhy, Bill Dubuque divisibility
Users with the  divisibility badge can single-handedly close divisibility questions as duplicates and reopen them as needed.

StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
 Dec 27 '18 at 23:57


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.


















  • $begingroup$
    Hi & welcome to MSE. Please show us what you've tried so far & are having difficulty with. Thanks.
    $endgroup$
    – John Omielan
    Dec 27 '18 at 23:29
















-2












$begingroup$



This question already has an answer here:




  • Fibonacci modular results $ F_nmid F_{kn},,$ $, gcd(F_n,F_m) = F_{gcd(n,m)}$

    5 answers




We are give Fibonacci numbers.{fi
| i ∈ N}, where f0 = 0, f1 = 1, fn+2 = fn +fn+1, n∈ N. How to proof with mathematical induction that if n divides by m, then fn divides by fm?
I am having trouble with thinking, what should be the transition.






induction divisibility fibonacci-numbers







share|cite|improve this question











$endgroup$



marked as duplicate by anomaly, Crostul, amWhy, Bill Dubuque divisibility
Users with the  divisibility badge can single-handedly close divisibility questions as duplicates and reopen them as needed.

StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
 Dec 27 '18 at 23:57


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.


















  • $begingroup$
    Hi & welcome to MSE. Please show us what you've tried so far & are having difficulty with. Thanks.
    $endgroup$
    – John Omielan
    Dec 27 '18 at 23:29














-2












-2








-2





$begingroup$



This question already has an answer here:




  • Fibonacci modular results $ F_nmid F_{kn},,$ $, gcd(F_n,F_m) = F_{gcd(n,m)}$

    5 answers




We are give Fibonacci numbers.{fi
| i ∈ N}, where f0 = 0, f1 = 1, fn+2 = fn +fn+1, n∈ N. How to proof with mathematical induction that if n divides by m, then fn divides by fm?
I am having trouble with thinking, what should be the transition.






induction divisibility fibonacci-numbers







share|cite|improve this question











$endgroup$





This question already has an answer here:




  • Fibonacci modular results $ F_nmid F_{kn},,$ $, gcd(F_n,F_m) = F_{gcd(n,m)}$

    5 answers




We are give Fibonacci numbers.{fi
| i ∈ N}, where f0 = 0, f1 = 1, fn+2 = fn +fn+1, n∈ N. How to proof with mathematical induction that if n divides by m, then fn divides by fm?
I am having trouble with thinking, what should be the transition.





This question already has an answer here:




  • Fibonacci modular results $ F_nmid F_{kn},,$ $, gcd(F_n,F_m) = F_{gcd(n,m)}$

    5 answers







induction divisibility fibonacci-numbers




induction divisibility fibonacci-numbers






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 27 '18 at 23:36







Edvards Zakovskis

















asked Dec 27 '18 at 23:28









Edvards ZakovskisEdvards Zakovskis

354




354




marked as duplicate by anomaly, Crostul, amWhy, Bill Dubuque divisibility
Users with the  divisibility badge can single-handedly close divisibility questions as duplicates and reopen them as needed.

StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
 Dec 27 '18 at 23:57


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.









marked as duplicate by anomaly, Crostul, amWhy, Bill Dubuque divisibility
Users with the  divisibility badge can single-handedly close divisibility questions as duplicates and reopen them as needed.

StackExchange.ready(function() {
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function() {
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function() {
$hover.showInfoMessage('', {
messageElement: $msg.clone().show(),
transient: false,
position: { my: 'bottom left', at: 'top center', offsetTop: -7 },
dismissable: false,
relativeToBody: true
});
},
function() {
StackExchange.helpers.removeMessages();
}
);
});
});
 Dec 27 '18 at 23:57


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.














  • $begingroup$
    Hi & welcome to MSE. Please show us what you've tried so far & are having difficulty with. Thanks.
    $endgroup$
    – John Omielan
    Dec 27 '18 at 23:29


















  • $begingroup$
    Hi & welcome to MSE. Please show us what you've tried so far & are having difficulty with. Thanks.
    $endgroup$
    – John Omielan
    Dec 27 '18 at 23:29
















$begingroup$
Hi & welcome to MSE. Please show us what you've tried so far & are having difficulty with. Thanks.
$endgroup$
– John Omielan
Dec 27 '18 at 23:29




$begingroup$
Hi & welcome to MSE. Please show us what you've tried so far & are having difficulty with. Thanks.
$endgroup$
– John Omielan
Dec 27 '18 at 23:29










1 Answer
1






active

oldest

votes


















0












$begingroup$

First prove by induction on $m$ that



$F_{m+n}=F_{m+1}F_n+F_mF_{n+1}-F_m F_n$



Then put $m=kn$ and find that if $F_n|F_{kn}$ then $F_n|F_{(k+1)n}$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    +1 then -1. The battle is on!
    $endgroup$
    – Oscar Lanzi
    Dec 27 '18 at 23:58


















1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









0












$begingroup$

First prove by induction on $m$ that



$F_{m+n}=F_{m+1}F_n+F_mF_{n+1}-F_m F_n$



Then put $m=kn$ and find that if $F_n|F_{kn}$ then $F_n|F_{(k+1)n}$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    +1 then -1. The battle is on!
    $endgroup$
    – Oscar Lanzi
    Dec 27 '18 at 23:58
















0












$begingroup$

First prove by induction on $m$ that



$F_{m+n}=F_{m+1}F_n+F_mF_{n+1}-F_m F_n$



Then put $m=kn$ and find that if $F_n|F_{kn}$ then $F_n|F_{(k+1)n}$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    +1 then -1. The battle is on!
    $endgroup$
    – Oscar Lanzi
    Dec 27 '18 at 23:58














0












0








0





$begingroup$

First prove by induction on $m$ that



$F_{m+n}=F_{m+1}F_n+F_mF_{n+1}-F_m F_n$



Then put $m=kn$ and find that if $F_n|F_{kn}$ then $F_n|F_{(k+1)n}$.






share|cite|improve this answer









$endgroup$



First prove by induction on $m$ that



$F_{m+n}=F_{m+1}F_n+F_mF_{n+1}-F_m F_n$



Then put $m=kn$ and find that if $F_n|F_{kn}$ then $F_n|F_{(k+1)n}$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 27 '18 at 23:48









Oscar LanziOscar Lanzi

12.9k12136




12.9k12136












  • $begingroup$
    +1 then -1. The battle is on!
    $endgroup$
    – Oscar Lanzi
    Dec 27 '18 at 23:58


















  • $begingroup$
    +1 then -1. The battle is on!
    $endgroup$
    – Oscar Lanzi
    Dec 27 '18 at 23:58
















$begingroup$
+1 then -1. The battle is on!
$endgroup$
– Oscar Lanzi
Dec 27 '18 at 23:58




$begingroup$
+1 then -1. The battle is on!
$endgroup$
– Oscar Lanzi
Dec 27 '18 at 23:58



-

Popular posts from this blog

Quarter-circle Tiles

Image
up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
Read more

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Image
0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
Read more

Mont Emei

Image
Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
Read more