Xjyuk

Ugin's Conjurant vs. un-preventable damage

Do Monks gain the 9th level Unarmored Movement benefit when wearing armor or using a shield?

A Latin text with dependency tree

How likely are Coriolis-effect-based quirks to develop in starship crew members?

What replaces x86 intrinsics for C when Apple ditches Intel CPUs for their own chips?

Compactness in normed vector spaces.

Can a planet still function with a damaged moon?

How to get MAX value using SOQL when there are more than 50,000 rows

Is there a need for better software for writers?

Tub Drain SLOWLY Drains - If You Hold "Knob" Down It Drains At Regular Speed

Why are thrust reversers not used to slow down to taxi speeds?

Are on’yomi words loanwords?

What's the "magic similar to the Knock spell" referenced in the Dungeon of the Mad Mage adventure?

Fibonacci sequence calculator seems correct but can't find similar code online. Is there something wrong?

Renting a house to a graduate student in my department

Why do the Avengers care about returning these items in Endgame?

How do carbureted and fuel injected engines compare in high altitude?

Was the Highlands Ranch shooting the 115th mass shooting in the US in 2019

My perfect evil overlord plan... or is it?

Is it a Munchausen Number?

How can I test a shell script in a "safe environment" to avoid harm to my computer?

Row vectors and column vectors (Mathematica vs Matlab)

Why does the electron wavefunction not collapse within atoms at room temperature in gas, liquids or solids due to decoherence?

"Estrontium" on poster

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;

6

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

share|improve this question

asked 5 hours ago

fibonaccipistaccifibonaccipistacci

311

New contributor

fibonaccipistacci is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

add a comment | 

6

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

share|improve this question

asked 5 hours ago

fibonaccipistaccifibonaccipistacci

311

New contributor

fibonaccipistacci is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

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

share|improve this question

asked 5 hours ago

fibonaccipistaccifibonaccipistacci

311

New contributor

fibonaccipistacci is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

i=1
n=0
while i<=20000:
 i = i + n
 n = i - n
 print(i)

1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584
4181
6765
10946
17711
28657

share|improve this question

asked 5 hours ago

fibonaccipistaccifibonaccipistacci

311

New contributor

fibonaccipistacci is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|improve this question

asked 5 hours ago

fibonaccipistaccifibonaccipistacci

311

New contributor

fibonaccipistacci is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 5 hours ago

fibonaccipistaccifibonaccipistacci

311

New contributor

fibonaccipistacci is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 5 hours ago

fibonaccipistaccifibonaccipistacci

311

2 Answers
2

active

oldest

votes

7

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.

share|improve this answer

edited 39 mins ago

answered 5 hours ago

paxdiablopaxdiablo

648k17912691695

add a comment | 

4

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.

share|improve this answer

edited 3 mins ago

cs95

145k25177257

answered 5 hours ago

Ned BatchelderNed Batchelder

265k53450572

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
);



);

fibonaccipistacci is a new contributor. Be nice, and check out our Code of Conduct.

draft saved

draft discarded

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

Name

Email

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

Name

Email

Required, but never shown

7

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.

share|improve this answer

edited 39 mins ago

answered 5 hours ago

paxdiablopaxdiablo

648k17912691695

add a comment | 

7

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.

share|improve this answer

edited 39 mins ago

answered 5 hours ago

paxdiablopaxdiablo

648k17912691695

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.

share|improve this answer

edited 39 mins ago

answered 5 hours ago

paxdiablopaxdiablo

648k17912691695

i = i + n # iNew = iOld + nOld

n = i - n # nNew = (iNew) - nOld
 # = (iOld + nOld) - nOld
 # = iOld + (nOld - nOld)
 # = iOld + (0)
 # = iOld

nextN = i + n
i = n
n = nextN

(n, i) = (i, n + i)

share|improve this answer

edited 39 mins ago

answered 5 hours ago

paxdiablopaxdiablo

648k17912691695

answered 5 hours ago

paxdiablopaxdiablo

648k17912691695

answered 5 hours ago

paxdiablopaxdiablo

648k17912691695

4

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.

share|improve this answer

edited 3 mins ago

cs95

145k25177257

answered 5 hours ago

Ned BatchelderNed Batchelder

265k53450572

add a comment | 

4

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.

share|improve this answer

edited 3 mins ago

cs95

145k25177257

answered 5 hours ago

Ned BatchelderNed Batchelder

265k53450572

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.

share|improve this answer

edited 3 mins ago

cs95

145k25177257

answered 5 hours ago

Ned BatchelderNed Batchelder

265k53450572

i = i + n
n = i - n

new_i = i + n
n = i
i = new_i

i, n = i + n, i

share|improve this answer

edited 3 mins ago

cs95

145k25177257

answered 5 hours ago

Ned BatchelderNed Batchelder

265k53450572

edited 3 mins ago

cs95

145k25177257

edited 3 mins ago

cs95

145k25177257

answered 5 hours ago

Ned BatchelderNed Batchelder

265k53450572

answered 5 hours ago

Ned BatchelderNed Batchelder

265k53450572