Go Back > Great Internet Mersenne Prime Search > Math > Number Theory Discussion Group

Thread Tools
Old 2018-10-27, 05:37   #12
paulunderwood's Avatar
Sep 2002
Database er0rr

3·1,049 Posts

I have written up a refinement of this resultant idea, proof lacking -- anyone?
paulunderwood is offline   Reply With Quote
Old 2018-11-09, 07:07   #13
paulunderwood's Avatar
Sep 2002
Database er0rr

C4B16 Posts
Default Semi-primes again

Recapping the definitions:

n(b)=\prod_{i\le s}(k_i b+1)^{e_i}



g(b)=\prod_{i\le s}(k_i b+2)^{e_i}


Conjecture: x^{n+1}\equiv 1 \pmod{n, x^2-ax+1} implies

x^H\equiv 1 \pmod{n, x^2-ax+1} (**) where


Now let the semi-prime n=(Sb+1)(Tb+1)

I claim that if (**) holds then:

\gcd((\sum_{i=0}^{\lfloor\frac{S-1}{2}\rfloor}-1^i{S-1-i\choose i}a^{S-1-2i})(\sum_{j=0}^{\lfloor\frac{T-1}{2}\rfloor}-1^j{T-1-j\choose j}a^{T-1-2j}),n) = n

Last fiddled with by paulunderwood on 2018-11-09 at 07:16
paulunderwood is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Semi-prime factorization conjecture Alberico Lepore Alberico Lepore 7 2018-02-16 08:27
Probability that n is a semi-prime or prime carpetpool Miscellaneous Math 27 2017-01-19 21:00
Prime testing software suggestions please. ishkibibble Conjectures 'R Us 15 2013-03-14 08:41
How does this whole prime-testing thing work? Unregistered Software 27 2004-09-13 21:35
Semi-automated P-1 testing GP2 Marin's Mersenne-aries 2 2003-09-29 19:01

All times are UTC. The time now is 21:31.

Thu Apr 9 21:31:38 UTC 2020 up 15 days, 19:04, 0 users, load averages: 1.34, 1.86, 1.93

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.