| 10 || 3, 487, 56598313 | |----- | 11 || 71 | |----- | 12 || 2693, 123653 | |----- | 13 || 2, 863, 1747591 | |----- | 14 || 29, 353, 7596952219 | |----- | 15 || 29131, 119327070011 | |----- | 16 || 1093, 3511 | |----- | 17 || 2, 3, 46021, 48947, 478225523351 | |----- | 18 || 5, 7, 37, 331, 33923, 1284043 | |----- | 19 || 3, 7, 13, 43, 137, 63061489 | |----- | 20 || 281, 46457, 9377747, 122959073 | |----- | 21 || 2 | |----- | 22 || 13, 673, 1595813, 492366587, 9809862296159 | |----- | 23 || 13, 2481757, 13703077, 15546404183, 2549536629329 | |----- | 24 || 5, 25633 | |----- | 25 || 2, 20771, 40487, 53471161, 1645333507, 6692367337, 188748146801 | |----- | 26 || 3, 5, 71, 486999673, 6695256707 | |----- | 27 || 11, 1006003 | |----- | 28 || 3, 19, 23 | |----- | 29 || 2 | |----- | 30 || 7, 160541, 94727075783 | |} For more information, see and. The smallest solutions of qp(a) ≡ 0 (mod p) with a = n are: 2, 1093, 11, 1093, 2, 66161, 5, 3, 2, 3, 71, 2693, 2, 29, 29131, 1093, 2, 5, 3, 281, 2, 13, 13, 5, 2, 3, 11, 3, 2, 7, 7, 5, 2, 46145917691, 3, 66161, 2, 17, 8039, 11, 2, 23, 5, 3, 2, 3, ... A pair (p, r) of prime numbers such that qp(r) ≡ 0 (mod p) and qr(p) ≡ 0 (mod r) is called a Wieferich pair. References External links Gottfried Helms. Fermat-/Euler-quotients (ap-1 – 1)/pk with arbitrary k. Richard Fischer. Fermat quotients B^(P-1) == 1 (mod P^2). Number theory