Prime Number Checker

            def is_prime(n: int) -> int:
    if n < 2: return 0
    if n == 2: return 1
    if n % 2 == 0: return 0
    d = 3
    while d * d <= n:
        if n % d == 0: return 0
        d += 2
    return 1
assert is_prime(97) == 1
          

            #include <assert.h>
#include <stdint.h>
int is_prime(uint64_t n){if(n<2)return 0;if(n==2)return 1;if(!(n&1))return 0;for(uint64_t d=3;d<=n/d;d+=2)if(n%d==0)return 0;return 1;}
int main(void){assert(is_prime(97)==1);}
          

            #include <cassert>
#include <cstdint>
int is_prime(std::uint64_t n){if(n<2)return 0;if(n==2)return 1;if(!(n&1))return 0;for(std::uint64_t d=3;d<=n/d;d+=2)if(n%d==0)return 0;return 1;}
int main(){assert(is_prime(97)==1);}
          

x86-64 NASM · System V ABI · Linux · integer arguments in rdi, rsi and rdx

            ; uint64_t is_prime(uint64_t n), returns 1 or 0
global is_prime
section .text
is_prime:
    cmp rdi, 2
    jb .no
    je .yes
    test dil, 1
    jz .no
    mov rcx, 3
.loop:
    mov rax, rcx
    imul rax, rcx
    cmp rax, rdi
    ja .yes
    mov rax, rdi
    xor edx, edx
    div rcx
    test rdx, rdx
    jz .no
    add rcx, 2
    jmp .loop
.yes:
    mov eax, 1
    ret
.no:
    xor eax, eax
    ret
          

            function result = is_prime(n)
    result = double(isprime(round(n)));
end
          

            ClearAll[mwCalculate];
mwCalculate[n_Integer] := Boole[PrimeQ[n]];