A number theory problem by Yash Singhal

Trevor creates an infinite sequence S S of integers by repeatedly adding the digits 2 , 0 , 1 2,0,1 and 3 3 to the previous numbers in the sequence. For example, the first few numbers that he forms are: 2 , 20 , 201 , 2013 , 20132 , 201320 , 2013201 , 20132013 , 201320132 2,20,201,2013,20132,201320,2013201,20132013,201320132 and so on. Find the number of primes in S S .


The answer is 1.

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.

2 solutions

@ 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)

Geoff Pilling
Aug 24, 2016

Whenever you add 0 0 or 2 2 the number will be divisible by 2 2 , and whenever you add 1 1 or 3 3 it will be divisible by 3 3 . So, only the first number 2 2 is a prime number.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...