Trevor creates an infinite sequence of integers by repeatedly adding the digits and to the previous numbers in the sequence. For example, the first few numbers that he forms are: and so on. Find the number of primes in .
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.
@ first U add (0) to (2) then add (1)& Add (3) @ the end . as we see if the number ends with (0) or (2) ,it is not prime . when U add (1) to the number it becomes devisible by (3). so when we add (3) after we add 1 it becoms devisable by (3) again Hence ,there is no prime will be (except 2 ) Try This : Suppose( 2+0=x ) ,( x+1=y ), y+3=z , where (x,y,z are sum of the digits of the numbers)