Click here to Skip to main content
15,917,177 members
Please Sign up or sign in to vote.
1.00/5 (1 vote)
See more:
0


given a positive integer N, check if N is a special circular prime number. a circular/cyclic number for a given number is generating by left/right rotating digits. the special circular prime number for our purpose is defined as sum of all digits of the prime number is also a prime number. for example, 199 is special circular prime as 991 and 919 are also prime number and sum of digits is 1+9+9=19 is also a prime number. the number 1193 is circular prime but not the special circular prime since sum of digits is 1+9+9+3=14 is not a prime number 


What I have tried:

just found a coding to verify if the given number is a prime number or not
Posted
Updated 6-Feb-22 1:00am
Comments
Patrice T 6-Feb-22 6:35am    
And you have a question or problem ?

1 solution

While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]
 
Share this answer
 

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900