+ 2

to find the circular primes.you have given a number from user for that you have to check wheather it is circular prime or not.

for ex. 197..given by user you have to check -> 197->971->719->197.i.e first integer go to last repeatedly untill you get user given number.and NOTE:all the numbers which are formed after replacing should be prime..otherwise its not a circular prime

20th Sep 2017, 5:54 AM
satish genji
satish genji - avatar
5 Antworten
0
197
20th Sep 2017, 5:54 AM
satish genji
satish genji - avatar
+ 5
Here is my approach in Ruby: (Updated in order to fulfill requirements) https://code.sololearn.com/c6lh9cEtgLaJ/
23rd Sep 2017, 5:41 AM
noobcøder
noobcøder - avatar
+ 3
Here is some code to check whether a number is a circular prime https://code.sololearn.com/cqr4ErJkuPqc/?ref=app
20th Sep 2017, 8:17 AM
David Ashton
David Ashton - avatar
0
2 :=)
20th Sep 2017, 6:10 AM
Dmitry Semigradsky
Dmitry Semigradsky - avatar
0
wrong dude
20th Sep 2017, 6:12 AM
satish genji
satish genji - avatar