Euler pseudoprime
id:
euler-pseudoprime-265-2391453
title:
Euler pseudoprime
text:
In arithmetic, an odd composite integer n is called an Euler pseudoprime to base a, if a and n are coprime, and (where mod refers to the modulo operation). The motivation for this definition is the fact that all prime numbers p satisfy the above equation which can be deduced from Fermat's little theorem. Fermat's theorem asserts that if p is prime, and coprime to a, then ap−1 ≡ 1 (mod p). Suppose that p>2 is prime, then p can be expressed as 2q + 1 where q is an integer. Thus, a(2q+1) − 1 ≡ 1 (m
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Euler_pseudoprime
date created:
date modified:
2023-04-05T20:45:23Z
main entity:
{"identifier":"Q356653","url":"https://www.wikidata.org/entity/Q356653"}
image:
fields total:
13
integrity:
13