This site is supported by donations to The OEIS Foundation.

# User:A. Lamek

### From OeisWiki

## My interests

I come from Germany, NRW.

I'm interested in numbers, especially Mersenne Primes and Wieferich Primes. However my level of understanding of number theory is nowhere near that of a mathematicians. Please have little bit of patience with me. Email: blackpuma65@googlemail.com

## My favored sequences

## My assumptions

** Mersenne primes:** Factors

Mersenne prime numbers 2^{p} − 1, which are not prime, divided by 2*k**p* + 1. In this known formula can | *k* | the values 1, 2, 3, 4, etc.

So that the divider 2*p* + 1, 4*p* + 1, 6*p* + 1, 8*p* + 1 etc could be.

According to my observation, there are, however, gaps in | *k* | , where no divider occur. These gaps have a mathematically calculable uniformity:

ie.

** Mersenne numbers (nonprimes):** binomially or triangular !?

__Wieferich primes__

__A new property of Wieferich primes:__

This formula shows that from one base of exponent |E|

2 Wieferich primes (1093, 3511) can be calculated.

My last hunch is that the exponent |*b*| is calculated as follows:

Only for *n* = 2 there an appropriate solution. If 2^{b + 1} − 1 the next Mersenne prime, than gives the next 2 Wieferich primes with

footnote:

[1] by Johnson (1977) (see A note on the two known Wieferich Primes)

- his formula for the Wieferich primes is
- "1092 = 4 * (16
^{3}− 1) / (16 − 1) (base 10)" - "3510 = 6 * (8
^{4}− 1) / (8 − 1) (base 10)"

- "1092 = 4 * (16