Moved from Number Theory, it has no reason to be there

[ONeil]

Originally Posted by diep

I'm busy sieving 32767 * 2 ^ n - 1 very deeply now (and busy testing it at the first few millions of bits or so - each time narrowing down the boundaries of the sieve domain).

Well deeply -that's as far as the hardware allows here. Nowhere nearby what PG manages to achieve of course.

What i notice is that to my surprise it keeps finding factors and removing exponents also at higher bitlevels.

Whereas other riesels with a similar nash weight dry up much sooner.

Would the guess be logical to assume then odds for a prime is also much lower than similar nashed k's?

Hi diep I don't know if this matters or not, but I looked at your formula and I thought it could factor Mersenne numbers from what you said and to my surprise it does with the aid of python.

Here is the code:

import time
print('''diep factor method''')
while True:
	start_time = time.time()
	n = int(input('Enter a prime number: '))
	f = ((n) * (pow(2,n-1)*2-1))
	diep = (pow(2,n-1)*2-1)
	def isqrt(c):
		
		x = c
		y = (x + 1) // 2
		while y < x:
			x = y
			y = (x + c // x) // 2
		return x
		c = (floor(c))
		
	for x in range(1,(isqrt(diep))):
		if f%((x*n+1)) == 0 :
			print((x*n+1))
			e = int(time.time() - start_time)
			print('{:02d}:{:02d}:{:02d}'.format(e // 3600, (e % 3600 // 60), e % 60))
			break

[retina]

Originally Posted by ONeil

... I don't know if this matters or not ...

The answer is "not".

All you have there yet another version of your useless trial factoring code.

[LaurV]

Originally Posted by retina

The answer is "not".

Yep. Moved to blogorrhea.