Learn from your mistakes

Right now in the year 2020, technology has advanced so much. We have smartphones, tablets and even lights that light up just by clapping your hands! Nowadays your smartphone can control your lights, TV. Even TVs have become super thin unlike the older bulky TVs. Technology has given us so many gadgets. Due to this our lives have become so easy with hardly any problems.

Replica of Thomas Edison's First Electric

However hundreds of years ago life wasn't the same. Life was extremely difficult. Communication was a task. Letters took a long time to deliver and the reply took even longer. During day people worked but during the evening they were dependend on candle lamps. There were many problems. But one scientist’s inventions changed the world. His name was Thomas Edison.

He was born in the USA and was known as America’s greatest inventor. Edison invented many things such as the gramophone, motion picture camera and his most important invention was the electric light bulb. Today let me tell you a story about how Edison invented the light bulb. He tried to used different materials for the filament to make the light bulb and he failed 2,000 times. All these materials failed to create the bulb.

Edison’s assistant said, “All our hard work is in vain. We wasted our time and have learned nothing. I am not sure if we will ever be successful in making the bulb." Edison replied very confidently, “I know we have failed 2,000 times. Now I have learned that these 2,000 materials can never be used to create the bulb.

Now I can try with other materials. Edison finally found the right material and created the light bulb! Thomas Edison's invention has changed the world forever!

Moral of the Story:

If you want to be successful, first learn from your mistakes. When you learn from your mistakes, you will not repeat them again. This help will you succeed. No matter how many times you fail, never give up! Keep learning and you will succeed!

Comments

Fibonacci Sequence and Rabbit Problem

Hello friends hope you all are good , healthy and safe. In this Blog we will learn about fibonacci Sequence , golden ratio,relation between them , rabbit problem and many more. Fibonacci Greatest mathematician of the middle ages, Fibonacci. Fibonacci was born in pisa around 850 years ago. He was a famous Italian mathematician. In the year 1202 he finished his book "Liber Abeci". The book of calculations that brought Arabic numerals to Europe, the zero one,two that we use today. Fibonacci also presented a growing rabbit population problem. And after solving this problem he derived the famous sequence of numbers that is named after him, The Fibonacci Sequence . Suppose you put a male-female pair of newly born rabbits in a field . Rabbits take a month to mature before mating. After o ne month , females gives birth to one male-female pair and then mate again. No rabbits die. How many rabbit pairs are there after one year? To solve this, we construct table. At the start of each ...

Fibonacci Sequence Problem set 1

Problems 1. The Fibonacci numbers can be extended to zero and negative indices using the relation Fn = Fn+2 − Fn+1 . Determine F0 and find a general formula for F−n in terms of Fn. Prove your result using mathematical induction. Solution: F0 = F2 − F1 = 0, F−1 = F1 − F0 = 1, F−2 = F0 − F−1 = −1, F−3 = F−1 − F−2 = 2, F−4 = F−2 − F−3 = −3, F−5 = F−3 − F−4 = 5, F−6 = F−4 − F−5 = −8. The correct relation appears to be F−n = (−1)^(n+1)×Fn .............(1) We now prove equation (1) by mathematical induction. Base case: Our calculation above already shows that equation (1) is true for n = 1 and n = 2, that is, F−1 = F1 and F−2 = −F2. Induction step: Let us assume that (1) is true for positive integers n = k − 1 and n = k. Then we have F−(k+1) = F−(k−1) − F(−k) ..(from definition) = (−1)^k×Fk−1 − (−1)^(k+1)×Fk ...

Fibonacci Sequence and Climbing Staircase problem

Hello Friends, So here is our next blog on Fibonacci Sequence. In this blog I will introduce another problem whose solution is the Fibonacci Number. This problem is known as Climbing Staircase problem. The Question is How many ways one can climb staircase with n steps, taking one or two steps at a time ?? Questions Of Climbing Staircase Eg. Suppose we have 3 steps to climb. So we have a Staircase, we climb it by taking one step , one step , one step or two step , one step or one step, two step. So If we have n-steps in Staircase , then how many different ways can we climb the Staircase? So to answer this question we could make a table, considering small numbers of steps i.e n = 1,2,3,4,5 And we can list the number of ways to climb the Staircase. So Observe the table first column is number of stairs or steps. Second column is the list of ways one can climb by taking one or two steps at a time. Third column a n the total number of ways to climb Staircase. I hope y...

Innovious 360

Search This Blog