Cicadas live underground for most of their lives and only emerge in the spring of their last year in order to mate and reproduce. The North American Genus of Cicada, known as Magicicada, has an extremely long life cycle of 13 or 17 years. Each brood of cicadas has its own emergent years and life cycles.
The state of Kansas only gets 2 broods of Magicicada. The first brood last appeared in 1998 and has a life cycle of 17 years. The second brood last appeared in 2011 and has a life cycle of 13 years. (It is now 2014.) How many years will it take for both broods to emerge together?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
what is chinese remainder theorem
i also got the answer, but im impressed with your solution sir.. nice
That is a clever solution! I had not noticed that the broods concur in 1998 until you pointed that out.
Why use the chinese remainder...simply find the LCM of 17 and 13 and decrease the answer by (2014-1998)=16 years..
Note that 2 0 1 1 is 1 3 years from 1 9 9 8 , so to find when the 1 7 year cycle meets the 1 3 year cycle we can start from 1 9 9 8 .
lcm ( 1 7 , 1 3 ) = 2 2 1 , so in 2 2 1 years from 1 9 9 8 the cycles will meet. This is equivalent to 2 0 5 years from 2 0 1 4 .
COOL dude....
well this is an easy way out.
BEST way to solve this question....
I am not very good at number theory so I solved it using some logical reasoning. Also I was forced to solve it because I wanted that disgusting image disappear from my homepage. :D
Let x 1 and x 2 denote the years of emergence of two broods. Then we have,
x 1 = 1 9 9 8 + 1 7 n 1
x 2 = 2 0 1 1 + 1 3 n 2
where n 1 and n 2 are integers. We want smallest positive integer solutions for n 1 and n 2 such that
x 1 = x 2
This gives,
1 7 n 1 − 1 3 n 2 = 1 3
Now by inspection we see that one solution in integers is n 1 = 0 and n 2 = − 1 .
Now to get positive solution, we should increase n 1 by certain amount. But this amount should be properly chosen so as to get integer solutions. Let d be this increment. Then to keep the balance, we have to change n 2 also properly.
For example, let t 1 and t 2 be one particular solution of the equation a x + b y = c . Then if we increase t 1 by d , then we must decrease t 2 by b a d . Thus to get integer solutions, b a d should be an integer. In our case, a and b are relatively prime so we must have smallest possible d equal to 1 3 which gives n 1 = 1 3 and n 2 = 1 6 . This gives x 1 = x 2 = 2 2 1 9 . This means it will take 2 2 1 9 − 2 0 1 4 = 2 0 5 years more for both broods emerge together.
LOL +1 for the 2nd line
sir you are really brilliant!!
very gud!!!...gr8!
Keep on adding 17 to 1998 and 13 to 2011 and check when the two numbers are same and they are same at 2219 ,so subtract 2014 from 2219 , you get 205.
This is one (good) way to solve the problem, but it gets very lengthy and time consuming once these 13's and 15's become larger numbers. Some thing you certainly dont want in Competitive Exams! :P
The last time the two broods emerged together was 1998 (2011-13=1998). So the next time they would meet would be the value of the lowest common multiple of 17 and 13 in years. As 17 and 13 are prime numbers the lowest common multiple is 17 x 13 which equals 221, so the next time the broods emerged together would be 221 years on from 1998. This means they emerge in 2219. 2219 is 205 years on from 2014 (2219 - 2014 = 205). So the answer is 205 .
For the premises of this problem, we will be counting centered at the year 2 0 0 0 . This means that the year 1 9 9 8 will be represented by − 2 , and 2 0 1 1 will be represented by 1 1 . We can represent the life cycles of each brood of cicadas with a relationship that relates the cycle number ( x or y ) to the year .
The first brood: ( − 2 , 1 5 , 3 2 , 4 9 , 6 6 . . . ) -> ( 1 7 x − 1 9 ) , where x is the cycle number.
The second brood: ( 1 1 , 2 4 , 3 7 , 5 0 , 6 3 . . . ) -> ( 1 3 y − 2 ) , where y is the cycle number.
We can now set the two expressions equal to each other and manipulate them to come up with a solution:
1 7 x − 1 9 = 1 3 y − 2
Rearranging, we get:
x = 1 7 1 3 y + 1
This yields that the smallest value for y such that the two expressions are equal is y = 1 7 , resulting in x = 1 4 .
Substituting the value, x = 1 4 into the expression, 1 7 x − 1 9 , we get that the first year that the two broods will emerge together is the year 2 2 1 9 .
Therefore, the broods will emerge 2 0 5 years from now.
sir you are really brilliant!!
I am sorry . My previous comment was for Mr Snehal!!
Why you didn't take 2014 as the center? If you did that, you would directly get 205. Good thinking anyway... :)
first brood has his first cycle in 2015, and second started in 2011, so there is 4 years gap, we have to cover this gap to make their cycle in same year, Now LCM of 13,17 is 17*13=221, we have to make 4 years to cover the gap so by hit n trial if we subtract each integer from their LCM it will give us the desired result... i.e. 221-17=204, 221-13=208, 208-204=4, so this 4 year gap will be coverd after 204 years of 2015 means in 2219 i.e after 205 years of 2014...
Its awesomely easy. Just notice the dates. The 2nd brood last appeared in 2011. So when did it second last appear. Yups on 1998! The same as the last time the 1st brood appeared.So now we have a common starting point. Now just HCF of 17 and 13 = 221. But we have to find no. of years from now (2014). So no. of years= [221- (2014-1998)] =221-16=205. 205 is the answer. Hurray!
\DeclareMathOperator \lcm l c m The year 2011 is 13 years after 1998. Call 1998 year 0. The cycles meet at year 0; our goal is to find the next year during which they meet. Mathematically, this is equivalent to l c m ( 1 3 , 1 7 ) . 13 and 17 are both prime, so the smallest integer solution is 1 3 × 1 7 = 2 2 1 years after year 0. Finally, we calculate how many years after 2014 this year occurs. 2 0 1 4 − 1 9 9 8 = 1 6 , and 2 2 1 − 1 6 = 2 0 5 .
After reading the second paragraph again you will see that the first brood appeared in 1998 and appears every 17 years and the second brood appeared in 2011 and appears every 13 years. this means that the 2nd brood also appeared in 1998!!
2011-13=1998
See!! So actually they will appear 17x13 (which is 221) year later together BUT from 1998. And it is 2014 (16 years from 1998).
So the 2 broods will appear after 221-16=205 years.
Hence the answer is 205!!!!
Both broods emerged before in 1998........take lcm of 13 & 17...it will be 221 & now it is 2014,.........so 2014 subtracted by 1998 is 16 & 221 minus 16 is 205.... so answer is 205
1998+17n = 2011+13m 17n=13(m+1) m=16, n=13 Hence no of years from 2014 = 13*m - 3 = 205
For the broods to emerge simultaneously, it must be that 2 0 1 1 + 1 3 x = 1 9 9 8 + 1 7 y for integers x , y from the given data. Rearranging this equation, we obtain 1 3 ( x + 1 ) = 1 7 y . This is a simple Diophantine equation with solutions of the form x = 1 7 k + 1 6 , y = 1 3 k + 1 3 for some positive integer k . To find when the broods first meet, set k = 0 . This gives x = 1 6 , y = 1 3 . Going back to the original equation, we see that 2 0 1 1 + 1 3 ⋅ 1 6 = 1 9 9 8 + 1 7 ⋅ 1 3 = 2 2 1 9 . 2 2 1 9 − 2 0 1 4 = 2 0 5 , so the answer is 2 0 5 years.
Problem Loading...
Note Loading...
Set Loading...
First note that both broods concur in 1 9 9 8 , because 2 0 1 1 − 1 3 = 1 9 9 8 . Then by the Chinese Remainder Theorem, the next solution to this system of modular equations, i.e. when their lifecycles will next intersect, is 1 9 9 8 + 1 3 ⋅ 1 7 = 2 2 1 9 , which is 2 2 1 9 − 2 0 1 4 = 2 0 5 years from now.