factorprime 0.1.4

Library for finding whether a number is prime or not and also determine its factors
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

pub mod logic {
    pub mod prime {
        pub fn check_prime(num: u32) {

            let mut is_prime: bool = true;
            for i in (num-1)..1 {
                println!("{}",i);
                if num % i == 0 {
                    println!("Number is not a prime number");
                    is_prime = false;
                    break;
                }
            }
            if is_prime {
                println!("Tabdeeli agai he")
            }



            // if num % 2 == 0 || num % 3 == 0 || num % 5 == 0 || num % 7 == 0 {
            //     println!("Tabdeeli agai he")
            // }
            // else {
            //     println!("Number is not a prime number")
            // }
        }
    }

    pub mod factors {
        pub fn check_factors(num: u32) {
            if num % 3 == 0 {
                println!("Men inko Rulaonga")
            }
            if num % 5 == 0 {
                println!("Mujhe Kion Nikala")
            }
            if num % 7 == 0 {
                println!("Barish hoti he toh Paani ata he")
            }
            else {
                println!("{}",num);
            }
        }
    }
}