Prev: Question about complex functions
Next: What is the Last Digit of PI?
From: Isaac on 4 Feb 2010 06:31
Greetings,

I have just come across very interesting work along the lines of my area of
interest. Gerard Langlet discovered a very interesting connection between
his "parity integral", Gray Code, and prime factorization.

Here is a link to his publication in French:
http://sboisse.free.fr/science/maths/factorisation-langlet-code-gray.php

Here is a pretty good Google translation (be sure to assemble the whole
chopped up URL and paste in your browser):
http://translate.google.com/translate?prev=hp&hl=en&u=http%3A%2F%2Fsboisse.free.fr%2Fscience%2Fmaths%2Ffactorisation-langlet-code-gray.php&sl=auto&tl=en

In the article he sets forth a purportedly efficient factorization method
using a certain gray code based partitioning scheme and a cyclical parity
function.

Can anyone comment and/or expand on this approach?

Also, is anyone aware of any other work, conjecture, or pertinent
knowledge/information related to such binary based approaches (e.g., using
binary codes like gray code) to understanding or analyzing prime numbers?

Thanks!
Ariel Bentolila-





 | 
Pages: 1
Prev: Question about complex functions
Next: What is the Last Digit of PI?