Python recursion code help

So i need to be able to write using recursion

~snip~

i need help on the above topics i'm not realyl sure where to start

I'm going to be harsh here, but I think this needs to be said.

It doesn't seem like you know even the absolute basics (about recursion or Python) that would enable you to do this properly.

This is far from the only time you've posted on here for help with a question without seeming to actually know anything about the topic.

The truth is, you may be able to work your way through to an answer like this, but without actually studying the underlying material,you're going to end up in a real mess eventually.

Are you actually attending all the relevant lectures?

In that example, a is a global variable. It is defined after the function is defined, but before the function is called.

This is looking better but I think your second return statement shouldn't be indented. There's another mistake but try this first.

So i need to be able to write using recursion

multiplication using addition
powers using multiplication
factorials and
the fibonacci sequence

so far i know that you layout roughly in this form of

def fib(n)
a=............
b=............
return ...... <- is the nth term

print(fib(2))

def main()

then you got your function whatnot but i need help on the above topics i'm not realyl sure where to start

An example of the fibonnachi one:
~snip~

I'm going to be harsh here, but I think this needs to be said.

It doesn't seem like you know even the absolute basics (about recursion or Python) that would enable you to do this properly.

This is far from the only time you've posted on here for help with a question without seeming to actually know anything about the topic.

The truth is, you may be able to work your way through to an answer like this, but without actually studying the underlying material,you're going to end up in a real mess eventually.

Are you actually attending all the relevant lectures?

This forum has a rule against posting full solutions.

Wat?

This is university work? 0_0

https://cdn.discordapp.com/attachments/322819040059850757/376750266994917386/unknown.png

i don't think 7 is what i'm looking for i was looking for 6=3x2

An example of the start of the fibonnachi one:

def fib(n)
If n=0
Return 0
[edited]

What is your code actually doing?

multiply(3) = 3 + multiply(2)
multiply(2) = 3 + multiply(1)
multiply(1) = 1

So multiply(3) = 3 + (3 + 1) = 7

But that's not what you want. There's a simple fix for this.

i think so, so probably so

if n==1
return 0

but that online one i was using just broke :/

What would multiply(3) give you with this change?

https://cdn.discordapp.com/attachments/322819040059850757/376758558747918347/unknown.png
6

I assume that's not what you want though? I'm guessing your multiply function is meant to multiply the input by 3.

So multiply(3) should equal 9...

https://cdn.discordapp.com/attachments/322819040059850757/376759130771161088/unknown.png

i've done this but i don't think it's recursion .__.

I assume that's not what you want though? I'm guessing your multiply function is meant to multiply the input by 3.

So multiply(3) should equal 9...

https://cdn.discordapp.com/attachments/322819040059850757/376759130771161088/unknown.png

i've done this but i don't think it's recursion .__.

but no i want it to multiply by the previuos number so if i stick 5 in i want 5x4 to come out

then again i'm not sure how i'd do recursion with any 2 numbers