4, 5, and 7 are mutually coprime, so you can use the Chinese remainder theorem right away.
We construct a number 
such that taking it mod 4, 5, and 7 leaves the desired remainders:
- Taken mod 4, the last two terms vanish and we have
so we multiply the first term by 3.
- Taken mod 5, the first and last terms vanish and we have
so we multiply the second term by 2.
- Taken mod 7, the first two terms vanish and we have
so we multiply the last term by 7.
Now,
By the CRT, the system of congruences has a general solution
or all integers 
, 
, the least (and positive) of which is 27.
f(n) is the nth term
Each term f(n) is found by adding the terms just prior to the nth term. Those two terms added are f(n-1) and f(n-2)
The term just before nth term is f(n-1)
The term just before the (n-1)st term is f(n-2)
----------------
For example, let's say n = 3 indicating the 3rd term
n-1 = 3-1 = 2
n-2 = 3-2 = 1
So f(n) = f(n-1) + f(n-2) turns into f(3) = f(2) + f(1). We find the third term by adding the two terms just before it.
f3) = third term
f(2) = second term
f(1) = first term
To find expanded form, we need to split up the digits. When you do that, you take one digit and cut off everything to the left of it, then make everything to the right zeros.
We don't need to keep the zeros.
We can check this by adding the numbers back up to get 
.
Answer:
Step-by-step explanation:
We are given that
We have to find the value of given logarithms by using change-base formula
Base-change formula:
Where x=New base
Using the formula then, we get
Substitute the values 
Then,we get
