-
Notifications
You must be signed in to change notification settings - Fork 0
/
primes.h
47 lines (41 loc) · 1.41 KB
/
primes.h
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
46
/*
* 2020 | pArm-S2 by Javinator9889
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see https://www.gnu.org/licenses/.
*
* Created by Javinator9889 on 2020 - pArm-S1.
*/
/*
* File: primes.h
* Author: Javinator9889
* Comments: Helpful operations for working with prime numbers.
* Revision history: v1.0
*/
// This is a guard condition so that contents of this file are not included
// more than once.
#ifndef PRIMES_H
#define PRIMES_H
#include <stdint.h>
#include <stdbool.h>
/**
* Checks if the given number is prime or not. More trials improves accuracy.
* Uses the Miller-Rabin primality test.
*
* @param p - the number to be checked.
* @param trials - the trials until a number is decided to be prime or
* check again.
* @return true if prime, else false.
*/
bool check_prime(int_fast64_t p, uint_fast16_t trials);
#endif /* PRIMES_H */