diff --git a/archive/r/prime-number.rs b/archive/r/prime-number.rs
new file mode 100644
index 000000000..5e6d62526
--- /dev/null
+++ b/archive/r/prime-number.rs
@@ -0,0 +1,34 @@
+//  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");
+    }
+}