Thé transformation is that the function moved 6 units down
Scientific notation:
5.0209003 x 10^4
Answer:(12,-5)
Step-by-step explanation: if you have (x-12)^2+(y+5)^2=100 you switch the signs of 12 and 5 opposite
Answer:
The lady is on the second door
Step-by-step explanation:
we have that
The sign on the first door reads "In this room there is a lady, and in the other one there is a tiger"
The sign on the second door reads "In one of these rooms, there is a lady, and in one of them there is a tiger."
so
The sign on the second door is true
The sign on the first door is true or false
Since one of these signs is true and the other is false, the sign in the first door must be false
therefore
The lady is on the second door
Answer:
f(n)=f(n-1)+f(n-2)
f(1)=1x
f(2)=1x
Step-by-step explanation:
This is the fibonacci sequence with each term times x.
Notice, you are adding the previous two terms to get the third term per consecutive triples of the sequence.
That is:
1x+1x=2x
1x+2x=3x
2x+3x=5x
3x+5x=8x
So since we need the two terms before the third per each consecutive triple in the sequence, our recursive definition must include two terms of the sequence. People normally go with the first two.
f(1)=1x since first term of f is 1x
f(2)=1x since second term of f is 1x
Yes, I'm naming the sequence f.
So I said a third term in a consecutive triple of the sequence is equal to the sum of it's two prior terms. Example, f(3)=f(2)+f(1) and f(4)=f(3)+f(2) and so on...
Note, the term before the nth term is the (n-1)th term and the term before the (n-1)th term is the (n-2)th term. Just like before the 15th term you have the (15-1)th term and before that one you have the (15-2)th term. That example simplified means before the 15th term you have the 14th and then the 13th.
So in general f(n)=f(n-1)+f(n-2).
So the full recursive definition is:
f(n)=f(n-1)+f(n-2)
f(1)=1x
f(2)=1x