Can this be written in other languages?

Yes, the logic for checking prime numbers can be implemented in various programming languages. Here are examples in Java, JavaScript, and Python:

Java

public class PrimeCheck {
    public static void main(String[] args) {
        for (int num = 2; num < 10; num++) {
            boolean isPrime = true;
            for (int i = 2; i < num; i++) {
                if (num % i == 0) {
                    System.out.println(num + " is not prime");
                    isPrime = false;
                    break;
                }
            }
            if (isPrime) {
                System.out.println(num + " is prime");
            }
        }
    }
}

JavaScript

for (let num = 2; num < 10; num++) {
    let isPrime = true;
    for (let i = 2; i < num; i++) {
        if (num % i === 0) {
            console.log(`${num} is not prime`);
            isPrime = false;
            break;
        }
    }
    if (isPrime) {
        console.log(`${num} is prime`);
    }
}

Python (Original Example)

for num in range(2, 10):
    is_prime = True
    for i in range(2, num):
        if num % i == 0:
            print(f"{num} is not prime")
            is_prime = False
            break
    if is_prime:
        print(f"{num} is prime")

These examples follow the same logic as your original Python code, checking each number for primality and printing the result. If you want to explore more about these languages, consider checking out relevant labs on LabEx!