Question

How can you represent the terms of a sequence explicitly? How can you represent them recursively?

Answer 1

@ganeshie8 @hartnn @SolomonZelman please help

Answer 2

@hba please help

Answer 3

Do you know about Fibonacci sequence?

Answer 4

No

Answer 5

Do you have a particular sequence?

Answer 6

no not really, just a simple explanation

Answer 7

just not getting it at all

Answer 8

0,1,1,2,3,5,8,13,21........

Answer 9

How would you represent this sequence?

Answer 10

idk 0+1=1 1+1=2 2+1=3 3+2=5

Answer 11

See there you are :D ,So what are you doing here? :) How would you represent this :D

Answer 12

3+5=8 5+8=13 13+8=21

Answer 13

So thats what the question is asking? What about the "recursive" part?

Answer 14

f(n)=f(n-1)+f(n-2)

Answer 15

oh kay so now im lost again lol what does that have to do with the sequence?

Answer 16

0[(f(n-2)],1[(f(n-1)],1[f(n)]

1=1+0

Answer 17

oh and thanks for helping! lol idk how lost id be without you!

Answer 18

HAHA lol :p

Answer 19

omg you really lost me there XD 0[(f(n-2)],1[(f(n-1)],1[f(n)] WHAT?!

Answer 20

Lol i think you are just tired and bored :p

Answer 21

no im literally confused XD

Answer 22

i don't understand it, i get the first part but recursive idk

Answer 23

You need some rest believe me :p you have done way too much of math :D Allow me to explain you what recursion is first :D

Answer 24

okay! its really early here lol please explain

Answer 25

Lol it's too late for me then :D Anyways,let's get back to the thing.Have you ever done programming btw? Do you know what factorial is?

Answer 26

yupppp

Answer 27

yup for both?

Answer 28

factorial yes, programming eh no lol

Answer 29

Lol okay... :p

n!=n*(n-1)*(n-2)....*1

let’s think about the factorial operation. The factorial operation is a perfect candidate for recursion because it is a problem that can easily be broken up into similar smaller problems!

5! = 5 * 4 * 3 * 2 * 1

So if we want to calculate the factorial of 5, we can think of it as multiplying 5 by the factorial of 4:

5! = 5 * 4!

Similarly, to calculate the factorial of 4, we multiply 4 by the factorial of 3:

4! = 4 * 3!

And so on...

So if we try to calculate this we can:

f(n)=n*f(n-1)
if i input 3 for instance

factorial(3)=3*factorial(2)
factorial(3)= 3* (2*factorial(1))
factorial(3)=3*2

Answer 30

Now you understand lol? :P

Answer 31

Ah a lot better lol thanks!

Answer 32

I know it ain't a easy concept Jelia. :D Anyways if you get rid of everything do message me i am bored :p

Your welcome :)

Answer 33

oh i've got more questions for ya lol give me 5 min

Answer 34

0_0 why you do dis to me? :p

Answer 35

Hey! you said ur bored! lol sooooo ill keep ya busy :) im a good friend XD

Answer 36

Haha lol no keep me engaged by talking to me :p or doing something crazy for me :D

Answer 37

i've got 5 questions for you after that ill be fun Jelia! lol

Answer 38

fun Jelia? HAHAHAHAH :p Seriously? :D Okay stop being so funny :D

Answer 39

generate the first five terms in the sequence using the explicit formula.
y(base)n=-5n-5