Question

How to check if a number is circular prime (cyclically rotate left will also be prime) in TypeScript

Answer 1

function is_prime(n: number) {
    if (n == 2) {
        return true;
    }
    if (n < 2 || n % 2 == 0) {
        return false;
    }
    for (let i = 3; i * i <= n; i += 2) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}
    
function cyclically_rotate_left(n: any) {
    let m: any = n;
    let p: number = 1;
    
    while (m >= 10) {
        p *= 10;
        m /= 10;
    }
    
    return parseInt((m + 10 * (n % p)));
}
    
function is_circular_prime(n: number) {
    if (!is_prime(n)) {
        return false;
    }
    
    let rotated_n = cyclically_rotate_left(n);
    
    while (rotated_n != n) {
        if (rotated_n < n || !is_prime(rotated_n)) {
            return false;
        }
        rotated_n = cyclically_rotate_left(rotated_n);
    }
    
    return true;
}

// 1193 = prime
// 3119 = prime
// 9311 = prime
// 1931 = prime

console.log(is_circular_prime(1193));




/*
run:

true

*/

 

70+ SQL courses for beginners and professionals