is_prime: Check if a number is prime

View source: R/is_prime.R

is_primeR Documentation

Check if a number is prime

Description

To check if a number n is prime, you only need to check for factors up to the square root of n. This is because if n has a factor greater than its square root, it must also have a smaller factor (since a factor is a number that divides n without leaving a remainder). This method significantly reduces the number of checks needed to determine if a number is prime.

Usage

is_prime(n)

Arguments

n

(numeric) Number to verify if it prime

Value

(bool) TRUE if the number is prime, FALSE if the number is not prime

Examples

is_prime(0)
is_prime(1)
is_prime(7)
is_prime(10)
is_prime(100011869)

Rrepest documentation built on April 4, 2025, 2:07 a.m.