Prime numbers are natural numbers greater than 1 that have no positive divisors other than 1 and themselves. Determining whether a number is prime is a fundamental problem in number theory and has applications in various fields, including cryptography and computer science.

In this challenge, you will implement a function to check if a given number is prime. You will use logical operators and conditional statements to handle the multiple conditions required to identify a prime number efficiently.

Your task is to complete the function is_prime(n: u32) -> bool that takes an unsigned integer n and returns a boolean value indicating whether n is a prime number.

Prime numbers are natural numbers greater than 1 that have no positive divisors other than 1 and themselves. Determining whether a number is prime is a fundamental problem in number theory and has applications in various fields, including cryptography and computer science.

In this challenge, you will implement a function to check if a given number is prime. You will use logical operators and conditional statements to handle the multiple conditions required to identify a prime number efficiently.

Your task is to complete the function is_prime(n: u32) -> bool that takes an unsigned integer n and returns a boolean value indicating whether n is a prime number.