A Collection of Code Snippets in as Many Programming Languages as Possible

This project is maintained by TheRenegadeCoder

Welcome to the Prime Number in Rust page! Here, you’ll find the source code for this program as well as a description of how the program works.

```
// Requirement https://sample-programs.therenegadecoder.com/projects/prime-number/
// Accept a number on command line and print if it is Composite or Prime
// Works till 39 digits, ...
use std::process;
fn main() {
//confirm integer is passed as commandline argument
let mut input_value = std::env::args().nth(1).expect("please input a non-negative integer");
// Trim the trailing newline
input_value = input_value.trim_end().to_string();
//String to Int
let input_num: u128 = input_value
.trim()
.parse()
.expect("please input a non-negative integer");
let mut n = 3 as u128;
let divisor = input_num /2 as u128;
if input_num % 2 == 0 {
println!("Composite");
process::exit(1);
}
while n < divisor {
if input_num % n == 0 {
println!("Composite");
process::exit(1);
}
n = n + 2;
}
if n >= divisor {
println!("Prime");
}
}
```

Prime Number in Rust was written by:

- Mallikarjuna S J

If you see anything you’d like to change or update, please consider contributing.

No ‘How to Implement the Solution’ section available. Please consider contributing.

No ‘How to Run the Solution’ section available. Please consider contributing.