Question

write an algorithm to check whether it is a circular prime number or not​

Answer 1

plz mark me branlist

Explanation:

We are given a number n. Our task is to check whether the number is circular prime or not.

Circular Prime : A prime number is said to be a circular prime if after any cyclic permutations of the digits, it remains a prime.

Answer 2

Answer:

$refer \: the \: attachment \:$

$for \: your \: answer$

Explanation :

A circular prime is a prime number with the property that the number generated at each intermediate step when cyclically permuting its (base 10) digits will be prime. For example, 1193 is a circular prime, since 1931, 9311 and 3119 all are also prime.