#prime #numbers #theory #module #import #germain #isgermainprime

ImtiazGermain

A Rust library that checks if a number is a Germain and Imtiaz-Germain prime or not

1 unstable release

0.1.2 Apr 11, 2023
0.1.1 Apr 11, 2023

#1868 in Math

MIT license

3MB
9K SLoC

JavaScript 9K SLoC // 0.2% comments Rust 56 SLoC // 0.2% comments Python 42 SLoC // 0.1% comments

Contains (WOFF font, 330KB) lato-normal-italic.woff, (WOFF font, 325KB) _static/css/fonts/lato-bold-italic.woff, (WOFF font, 310KB) _static/css/fonts/lato-bold.woff, (WOFF font, 310KB) _static/css/fonts/lato-normal.woff, (WOFF font, 195KB) _static/css/fonts/lato-bold-italic.woff2, (WOFF font, 185KB) _static/css/fonts/lato-bold.woff2 and 8 more.

ImtiazGermain

ImtiazGermain is a library intended for number theory, implementing an edited version of Germain primes, which got published in the book A Young Mathematician. Here is a algorithm for ImtiazGermain primes:

Input number n --> Calculate p = (n - 1) / 2 --> Check if n, p, and 2p + 1 are prime ------------------> 
|                                                  |                                                    |
|                                                  No                                                   |
|                                                  |                                                    |
|                                                  V                                                    |
Output "n is not an Imtiaz Germain prime"     <----- Stop                                               |
|                                                                                                       |
Yes                                                                                                     |
|                                                                                                       |
V                                                                                                       |
Calculate m = 2p + 1 --> Check if m is composite --> Calculate q = 2m + 1 --> Check if q is prime -No-->|
|                                                  |                              |                     
|                                                  No                             Yes                   
|                                                  |                              |                     
|                                                  V                              V                     
Output "n is not an Imtiaz Germain prime"     <----- Stop        Output "n is an Imtiaz Germain prime"  

Features

  • Germain Primes detection
  • Imtiaz-Germain primes detection

Installation

To use ImtiazGermain in your Rust project, add the following to your Cargo.toml file:

[dependencies]
ImtiazGermain = "0.1.1"

Alternatively, you can go on python as:

pip install imtiazgermain

Usage

To use ImtiazGermain in your Rust code, import the necessary modules:

use ImtiazGermain::primecheck::{isgermainprime, isimtiazgermainprime};

Then, call the desired encryption or utility function. For example, to encrypt a message using the Caesar cipher:

use std::io;
use ImtiazGermain::primecheck::{isgermainprime, isimtiazgermainprime};

fn main() {
    println!("Enter a number:");
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let n = input.trim().parse::<u64>().unwrap();

    if primecheck::isimtiazgermainprime(n) {
        println!("{} is an Imtiaz Germain prime", n);
    } else {
        println!("{} is not an Imtiaz Germain prime", n);
    }
}

You can use python as follows:

import ImtiazGermain.primecheck as pm

pc = pm.primecheck()
print(pc.isgermainprime(2))    # True
print(pc.isimtiazgermainprime(3))    # True
print(pc.isgermainprime(5)) #True
print(pc.isgermainprime(7))    # True

No runtime deps