20170628, 22:47  #1 
Jun 2017
15_{8} Posts 
Endomorphisms and Factoring
1. I need to find out a program that only deals in machine level 0s and 1s. What I mean is unlike C++, Java, etc...decimals are not converted to binary but it is a program where every number dealing is binary. There should be no fixed integer range so large blocks can be dealt with in a good way.
2. So, the supposed mersenne prime to binary. The about to be tested primes(P) are also in binary. Then, one uses endomorphisms [f][/P] which makes all the P appearances in the block supposed Mersenne prime to 000 s of P length. Then another endomorphism just performs subtraction right from the first or second place below 1's in the block. This can be created as a function. I am just looking for a program that handles large binary numbers. I am also open to knowing more about endomorphisms and factoring if there exists such theory. Last fiddled with by manasi on 20170628 at 23:02 
20170628, 22:54  #2 
If I May
"Chris Halsall"
Sep 2002
Barbados
2×3×1,567 Posts 
Just putting this out there for consideration...
Do any other regular Mersenne Forum members find it a bit odd that there are many new participants who get the "lingo", but ask really stupid questions? 
20170628, 23:03  #3 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
Could be my fault, I think I once posted a link to the forum, on a youtube comment, on a numberphile video.

20170628, 23:04  #4  
Sep 2002
Database er0rr
3,527 Posts 
Quote:
Code:
? n=2^171; ? binary(n) [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 

20170628, 23:05  #5 
Jun 2017
1101_{2} Posts 
That is a rude message. Is it not? If my question is that trivial to you, then you could have done the honours of answering it. Did you get my post?

20170628, 23:08  #6 
Jun 2017
13_{10} Posts 
Thank You. I will check out PARI/GP.

20170628, 23:36  #7 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 
https://en.wikipedia.org/wiki/Machine_code might also be something to read.

20170628, 23:48  #8 
Jun 2017
13 Posts 
@science man: That is not what I am saying, people use high level language. It converts everything to machine code. My problem is with HLLs and their fixd integer range which makes prime factoring or mathematical computations difficult. So I am looking for a modern low level program where the number system is binary and like machine language , since large amounts of bits and bytes are stored, working with them is simple. Prime factoring would be very comfortable with elementary computations.

20170628, 23:50  #9  
If I May
"Chris Halsall"
Sep 2002
Barbados
2×3×1,567 Posts 
Quote:
He also wisely told me that sometimes you simply touch the ball to cause a little trouble, when it was worth the effort. RIP ROK. 

20170628, 23:55  #10  
Sep 2002
Database er0rr
3,527 Posts 
Quote:
Code:
bc 1.06.95 Copyright 19911994, 1997, 1998, 2000, 2004, 2006 Free Software Foundation, Inc. This is free software with ABSOLUTELY NO WARRANTY. For details type `warranty'. ibase=2 obase=2 101010*101001 11010111010 Last fiddled with by paulunderwood on 20170629 at 00:09 

20170629, 00:01  #11  
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 89<O<88
3×29×83 Posts 
Quote:
Yes, every language still fundamentally works in binary, but typically in fixedwidth binary. GMP is a library for C (and therefore all its derivatives) that allows for arbitrarysize integers. It's very common in big number prime testing and factorization code. https://en.wikipedia.org/wiki/List_o...metic_software A lot of the languages and software packages in the above list use GMP under the hood. 
