It would be 56 seconds until both flicker at the same time
have a happy day :)
Answer:
n = 59
Step-by-step explanation:
The given equation of n is 
and we have to solve it for n.
........... (1)
⇒ 
{Rationalizing the numerator}
⇒ 
.............. (2)
Now, adding (1) and (2) we get
⇒ n + 5 = 64 {Squaring both sides}
⇒ n = 59 (Answer)
Answer:
7
9
Step-by-step explanation:
key is the number of letters in each word
Answer: The greatest number of pages Kenji can decorate = 3
Step-by-step explanation:
Given: Total heart stickers = 15
Total star stickers =12
If all the papers identical, with the same combination of heart and star stickers and no stickers left over.
Then the greatest number of pages Kenji can decorate = GCD(15,12) [GCD=greatest common divisor]
Since 15 = 3 x 5
12=2 x 2 x 3
GCD(15,12) =3
Hence, the greatest number of pages Kenji can decorate = 3
