Services
Technology Web App Development Mobile App Development Windows App Development Database Development UI/UX Development Cloud Development SEO Digital Marketing Guest Posting Content Writing Artificial Intelligence Data Science ERP Development CRM Development CMS Development LMS Development Business Listing Blockchain Technology Startup Promotion
Products
Data Converter Cleaner TUC - Unit Converter Import Export Survey Manager Tweet Controller
Developer
Article Blog Forum Interview Beginner News Startup Quiz
Users
Career
Apply Job Internship
Pricing
Login Sign Up Get a Quote

forum

home / developersection / forums / create a rust program to determine if a number is prime or not.
Ask Question

Create a Rust program to determine if a number is prime or not.

Utpal Vishwas 514 20 Jun 2023

Create a Rust program to determine if a number is prime or not.

rust programsrust
Updated 24 Jun 2023
Utpal Vishwas
Utpal Vishwas

Student

I am Utpal Vishwas from Uttar Pradesh. Have completed my B. Tech. course from MNNIT campus Prayagraj in 2022. I have good knowledge of computer networking.

Message

1 Answers

Aryan Kumar
Aryan Kumar 24 Jun 2023
Report Abuse

Sure, here is a Rust program to determine if a number is prime or not:

Rust

fn is_prime(number: i32) -> bool {
  // Check if the number is less than 2.
  if number < 2 {
    return false;
  }

  // Iterate over all numbers from 2 to the square root of the number.
  for i in 2..(number as f64).sqrt() as i32 + 1 {
    // Check if the number is divisible by any of the numbers.
    if number % i == 0 {
      // The number is not prime.
      return false;
    }
  }

  // The number is prime.
  return true;
}

fn main() {
  // Get the number from the user.
  let mut number = String::new();
  io::stdin().read_line(&mut number).unwrap();

  // Convert the number to an integer.
  let number: i32 = number.trim().parse().unwrap();

  // Check if the number is prime.
  let is_prime = is_prime(number);

  // Print the result.
  if is_prime {
    println!("The number {} is prime.", number);
  } else {
    println!("The number {} is not prime.", number);
  }
}

This program first checks if the number is less than 2. If it is, then the program returns false. Otherwise, the program iterates over all numbers from 2 to the square root of the number. For each number in the loop, the program checks if the number is divisible by the current number. If the number is divisible by the current number, then the program returns false. Finally, the program returns true if the number is not divisible by any of the numbers.

To run this program, you can save it as a .rs file and then compile and run it using the following commands:

Code snippet

rustc is_prime.rs
./is_prime

This will prompt you to enter a number. Enter a number and press Enter. The program will then print whether the number is prime or not.

advertising