Fibonacci sequence calculator seems correct but can't find similar code online. Is there something wrong?What is Sum of Even Terms In Fibonacci (<4million)? [Large Value Datatype Confusion]Python: Odd behavior with modulo operatorWhat's wrong with my Fibonacci sequence generator?What is wrong with my Fibonacci sequence calculation in Python?Quitting a loopAdding together the values of the elements in a vector in RWriting a method which returns the specified Fibonacci number?Fibonacci sequence calculator pythonFor below code, after certain period i am getting -ve values as output for +ve integer input. can anyone please explain the reason behind this?How to print the Fibonacci sequence, skipping every fourth number, replaces the skips with X and starts from 0
Split into three!
Piping the output of comand columns
How to create a `range`-like iterable object of floats?
Are there historical examples of audiences drawn to a work that was "so bad it's good"?
Are PMR446 walkie-talkies legal in Switzerland?
What is Orcus doing with Mind Flayers in the art on the last page of Volo's Guide to Monsters?
Determine direction of mass transfer
Is it normal to "extract a paper" from a master thesis?
Comparison of bool data types in C++
Status of proof by contradiction and excluded middle throughout the history of mathematics?
How does the Earth's center produce heat?
Count all vowels in string
What is the purpose of the yellow wired panels on the IBM 360 Model 20?
Why does Bran want to find Drogon?
Using too much dialogue?
Why is the Eisenstein ideal paper so great?
Can attacking players use activated abilities after blockers have been declared?
Why A=2 and B=1 in the call signs for Spirit and Opportunity?
Could a rotating ring space station have a bolo-like extension?
If I arrive in the UK, and then head to mainland Europe, does my Schengen visa 90 day limit start when I arrived in the UK, or mainland Europe?
To exponential digit growth and beyond!
Flatten not working
Is there an idiom that means that you are in a very strong negotiation position in a negotiation?
Writing "hahaha" versus describing the laugh
Fibonacci sequence calculator seems correct but can't find similar code online. Is there something wrong?
What is Sum of Even Terms In Fibonacci (<4million)? [Large Value Datatype Confusion]Python: Odd behavior with modulo operatorWhat's wrong with my Fibonacci sequence generator?What is wrong with my Fibonacci sequence calculation in Python?Quitting a loopAdding together the values of the elements in a vector in RWriting a method which returns the specified Fibonacci number?Fibonacci sequence calculator pythonFor below code, after certain period i am getting -ve values as output for +ve integer input. can anyone please explain the reason behind this?How to print the Fibonacci sequence, skipping every fourth number, replaces the skips with X and starts from 0
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty height:90px;width:728px;box-sizing:border-box;
I made a simple Fibonacci sequence calculator for the first 22 terms:
i=1
n=0
while i<=20000:
i = i + n
n = i - n
print(i)
Looks like the result is correct
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584
4181
6765
10946
17711
28657
but I can't seem to find similar code anywhere online. I think that's a big red flag. Can someone tell me what is wrong here? Is this inefficient code?
python fibonacci
asked May 9 at 0:39
fibonaccipistaccifibonaccipistacci
294
add a comment |
I made a simple Fibonacci sequence calculator for the first 22 terms:
i=1
n=0
while i<=20000:
i = i + n
n = i - n
print(i)
Looks like the result is correct
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584
4181
6765
10946
17711
28657
but I can't seem to find similar code anywhere online. I think that's a big red flag. Can someone tell me what is wrong here? Is this inefficient code?
python fibonacci
asked May 9 at 0:39
fibonaccipistaccifibonaccipistacci
294
add a comment |
I made a simple Fibonacci sequence calculator for the first 22 terms:
i=1
n=0
while i<=20000:
i = i + n
n = i - n
print(i)
Looks like the result is correct
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584
4181
6765
10946
17711
28657
but I can't seem to find similar code anywhere online. I think that's a big red flag. Can someone tell me what is wrong here? Is this inefficient code?
python fibonacci
asked May 9 at 0:39
fibonaccipistaccifibonaccipistacci
294
I made a simple Fibonacci sequence calculator for the first 22 terms:
i=1
n=0
while i<=20000:
i = i + n
n = i - n
print(i)
Looks like the result is correct
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584
4181
6765
10946
17711
28657
but I can't seem to find similar code anywhere online. I think that's a big red flag. Can someone tell me what is wrong here? Is this inefficient code?
python fibonacci
python fibonacci
asked May 9 at 0:39
fibonaccipistaccifibonaccipistacci
294
asked May 9 at 0:39
fibonaccipistaccifibonaccipistacci
294
asked May 9 at 0:39
fibonaccipistaccifibonaccipistacci
294
asked May 9 at 0:39
fibonaccipistaccifibonaccipistacci
294
asked May 9 at 0:39
fibonaccipistaccifibonaccipistacci
294
294
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
No, that code is fine. The probable reason you can't find similar code online is that it's unusual to use the subtraction operator in Fibonacci, which is a purely additive function, tn = tn-2 + tn-1.
It works, of course, since addition/subtraction is both commutative and associative, meaning that order and grouping of terms is unimportant:
i = i + n # iNew = iOld + nOld
n = i - n # nNew = (iNew) - nOld
# = (iOld + nOld) - nOld
# = iOld + (nOld - nOld)
# = iOld + (0)
# = iOld
Use of subtraction allows you to bypass needing a third variable, which would be something like this in a lesser language than Python:
nextN = i + n
i = n
n = nextN
In Python, you don't actually need that since you can use tuple assignment such as:
(n, i) = (i, n + i)
With that, everything on the right of the = is evaluated before any assignments to the left.
answered May 9 at 0:45
paxdiablopaxdiablo
650k18012721697
add a comment |
It's an unusual way to do it, but it's correct. Your lines:
i = i + n
n = i - n
are the same as doing:
new_i = i + n
n = i
i = new_i
or,
i, n = i + n, i
which would be the usual way in Python.
edited May 9 at 5:50
cs95
147k25186260
answered May 9 at 0:44
Ned BatchelderNed Batchelder
266k53452575
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f56050704%2ffibonacci-sequence-calculator-seems-correct-but-cant-find-similar-code-online%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
No, that code is fine. The probable reason you can't find similar code online is that it's unusual to use the subtraction operator in Fibonacci, which is a purely additive function, tn = tn-2 + tn-1.
It works, of course, since addition/subtraction is both commutative and associative, meaning that order and grouping of terms is unimportant:
i = i + n # iNew = iOld + nOld
n = i - n # nNew = (iNew) - nOld
# = (iOld + nOld) - nOld
# = iOld + (nOld - nOld)
# = iOld + (0)
# = iOld
Use of subtraction allows you to bypass needing a third variable, which would be something like this in a lesser language than Python:
nextN = i + n
i = n
n = nextN
In Python, you don't actually need that since you can use tuple assignment such as:
(n, i) = (i, n + i)
With that, everything on the right of the = is evaluated before any assignments to the left.
answered May 9 at 0:45
paxdiablopaxdiablo
650k18012721697
add a comment |
No, that code is fine. The probable reason you can't find similar code online is that it's unusual to use the subtraction operator in Fibonacci, which is a purely additive function, tn = tn-2 + tn-1.
It works, of course, since addition/subtraction is both commutative and associative, meaning that order and grouping of terms is unimportant:
i = i + n # iNew = iOld + nOld
n = i - n # nNew = (iNew) - nOld
# = (iOld + nOld) - nOld
# = iOld + (nOld - nOld)
# = iOld + (0)
# = iOld
Use of subtraction allows you to bypass needing a third variable, which would be something like this in a lesser language than Python:
nextN = i + n
i = n
n = nextN
In Python, you don't actually need that since you can use tuple assignment such as:
(n, i) = (i, n + i)
With that, everything on the right of the = is evaluated before any assignments to the left.
answered May 9 at 0:45
paxdiablopaxdiablo
650k18012721697
add a comment |
No, that code is fine. The probable reason you can't find similar code online is that it's unusual to use the subtraction operator in Fibonacci, which is a purely additive function, tn = tn-2 + tn-1.
It works, of course, since addition/subtraction is both commutative and associative, meaning that order and grouping of terms is unimportant:
i = i + n # iNew = iOld + nOld
n = i - n # nNew = (iNew) - nOld
# = (iOld + nOld) - nOld
# = iOld + (nOld - nOld)
# = iOld + (0)
# = iOld
Use of subtraction allows you to bypass needing a third variable, which would be something like this in a lesser language than Python:
nextN = i + n
i = n
n = nextN
In Python, you don't actually need that since you can use tuple assignment such as:
(n, i) = (i, n + i)
With that, everything on the right of the = is evaluated before any assignments to the left.
answered May 9 at 0:45
paxdiablopaxdiablo
650k18012721697
No, that code is fine. The probable reason you can't find similar code online is that it's unusual to use the subtraction operator in Fibonacci, which is a purely additive function, tn = tn-2 + tn-1.
It works, of course, since addition/subtraction is both commutative and associative, meaning that order and grouping of terms is unimportant:
i = i + n # iNew = iOld + nOld
n = i - n # nNew = (iNew) - nOld
# = (iOld + nOld) - nOld
# = iOld + (nOld - nOld)
# = iOld + (0)
# = iOld
Use of subtraction allows you to bypass needing a third variable, which would be something like this in a lesser language than Python:
nextN = i + n
i = n
n = nextN
In Python, you don't actually need that since you can use tuple assignment such as:
(n, i) = (i, n + i)
With that, everything on the right of the = is evaluated before any assignments to the left.
answered May 9 at 0:45
paxdiablopaxdiablo
650k18012721697
edited May 9 at 5:15
answered May 9 at 0:45
paxdiablopaxdiablo
650k18012721697
answered May 9 at 0:45
paxdiablopaxdiablo
650k18012721697
answered May 9 at 0:45
paxdiablopaxdiablo
650k18012721697
650k18012721697
add a comment |
add a comment |
It's an unusual way to do it, but it's correct. Your lines:
i = i + n
n = i - n
are the same as doing:
new_i = i + n
n = i
i = new_i
or,
i, n = i + n, i
which would be the usual way in Python.
edited May 9 at 5:50
cs95
147k25186260
answered May 9 at 0:44
Ned BatchelderNed Batchelder
266k53452575
add a comment |
It's an unusual way to do it, but it's correct. Your lines:
i = i + n
n = i - n
are the same as doing:
new_i = i + n
n = i
i = new_i
or,
i, n = i + n, i
which would be the usual way in Python.
edited May 9 at 5:50
cs95
147k25186260
answered May 9 at 0:44
Ned BatchelderNed Batchelder
266k53452575
add a comment |
It's an unusual way to do it, but it's correct. Your lines:
i = i + n
n = i - n
are the same as doing:
new_i = i + n
n = i
i = new_i
or,
i, n = i + n, i
which would be the usual way in Python.
edited May 9 at 5:50
cs95
147k25186260
answered May 9 at 0:44
Ned BatchelderNed Batchelder
266k53452575
It's an unusual way to do it, but it's correct. Your lines:
i = i + n
n = i - n
are the same as doing:
new_i = i + n
n = i
i = new_i
or,
i, n = i + n, i
which would be the usual way in Python.
edited May 9 at 5:50
cs95
147k25186260
answered May 9 at 0:44
Ned BatchelderNed Batchelder
266k53452575
edited May 9 at 5:50
cs95
147k25186260
edited May 9 at 5:50
cs95
147k25186260
edited May 9 at 5:50
cs95
147k25186260
147k25186260
answered May 9 at 0:44
Ned BatchelderNed Batchelder
266k53452575
answered May 9 at 0:44
Ned BatchelderNed Batchelder
266k53452575
answered May 9 at 0:44
Ned BatchelderNed Batchelder
266k53452575
266k53452575
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f56050704%2ffibonacci-sequence-calculator-seems-correct-but-cant-find-similar-code-online%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
