Find fibonacci series upto N terms using list comprehension

Question

Need to find the Fibonacci series up to N terms.

n=int(input("Enter the n terms: "))
f_val=0
fib_list=[f_val:=f_val + i for i in range(n)]
print(fib_list)

While executing the above program, I got the result:

Enter the n terms:  5
[0, 1, 3, 6, 10]

My doubt is: what is the purpose of f_val := f_val + i? I really don't know the purpose of := in Python. Can anyone help me to find the solution?

Does this answer your question? [Walrus Operator(Python)?](https://stackoverflow.com/questions/74106306/walrus-operatorpython) — Talha Tayyab, Jun 14 '23 at 13:16
You aren't getting the Fibonacci numbers; you're getting the triangular numbers. — chepner, Jun 15 '23 at 21:13

score -2 · Answer 1 · edited Jun 15 '23 at 20:06

-2

n = int(input("Enter the number of terms: "))

f_val = 0
fib_list = [f_val := f_val + (fib_list[i-1] if i > 0 else 1) for i in range(n)]

print(fib_list)

Correct the code and solution of your doubt is: f_val is the variable that stores the current value of the Fibonacci-like series. f_val + i calculates the next term by adding the current value of f_val with the loop variable i. f_val := f_val + i assigns the new calculated value to f_val for the next iteration.

edited Jun 15 '23 at 20:06

Jorge Luis

813
6
21

answered Jun 14 '23 at 11:40

Mayank Chauhan

1
1

1

Did you run your code? – Jorge Luis Jun 15 '23 at 10:49
`fib_list` isn't defined yet while the list comprehension is executing. Only after the right-hand side is fully evaluated is the result assigned to the name `fib_list`. – chepner Jun 15 '23 at 21:14

Find fibonacci series upto N terms using list comprehension

1 Answers1