Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Other literature type . 2019
License: CC BY
Data sources: ZENODO
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2019
Data sources: zbMATH Open
DBLP
Article . 2020
Data sources: DBLP
versions View all 4 versions
addClaim

Prime Power Divisors of Mersenne Numbers and Wieferich Primes of Higher Order.

Prime power divisors of Mersenne numbers and Wieferich primes of higher order
Authors: Skula, L.;

Prime Power Divisors of Mersenne Numbers and Wieferich Primes of Higher Order.

Abstract

Let a prime power \(p^n\) divide a Mersenne number \(M_q=2^q-1\). It is shown here that \(p\) is a Wieferich prime of order \(n\) if and only if \(p^{n+1}\) divides \(M_q\) or equivalently, if and only if the number 2 has multiplicative order \(q\) modulo \(p^{n+1}\). Recall that a Wieferich prime is characterized by \(2^{p-1}\equiv 1\pmod {p^2}\). In this generalization, a Wieferich prime of order \(n\) is a Wieferich prime for which \(2^{p^n-p^{n-1}}\equiv 1 \pmod {p^{2n}}\).

Keywords

Mersenne numbers, Wieferich primes, Congruences; primitive roots; residue systems, Primes

Powered by OpenAIRE graph
Found an issue? Give us feedback