[Fredrick]

Originally Posted by AntonioLao

Fredrick,

But I'm not interested in Riemann Hypothesis. Maybe Fermat's last algorithm. But my algorithm only takes up maybe 10 lines of computer program coding which I did in TI-84 and I'm claiming that it can find prime factors for an 8-digit composite number in a fraction of a second or less. I think what I really need is a patent lawyer and file a patent application as quickly as I can.

Go for it, Antonio,

I have done the same, back in 2000 to 2004. Yes, you need a patent lawyer. And possibly you are too late.

When I published my book in 2000, I decided to request a patent on the prime number delivery. Not necessarily to make money off of it, but to make that claim to the world of having discovered an aspect about prime numbers that others had not discovered before. My book was not getting much traction, and within a year I realized being able to make that claim would help me promote the idea of the pentaist toe.

It was in 2002 that Agrawal, c.s. (see: http://query.nytimes.com/gst/fullpag...51C1A9649C8B63 ) delivered their mathematical algorithm on prime numbers. It was quite exciting for me, because my book and the possible patent had left the opportunity open for me to still claim that first spot. Who knows, Agrawal c.s., may have even seen my book (it was printed not far from India, in Thailand), and they then quickly figured out the algorithm, which is already obvious if you see my delivery http://www.pentapublishing.com/Math.html. Still, they could have figured it out themselves as well (but I did not see the thrill of having done that on their faces in the published pictures of them).

Long story short, the back and forth on the patent was so involved with trivial legal terms and an alltime low level of nitpicking that I gave up in 2004 (or maybe it was 2005). I did not care about it anymore, and I do not care about it either. The thrill of having seen the structures hiding within the numbers was worth any trouble all by itself, and I get the sense you have experienced that same yourself. Good for you, and well-meant congratulations, because no one can take that actual moment of experiencing a truth away from you. For me, it is still important to share information with others, but being first or having the patent on a speck of information is not the real cake, only the man-made icing on the cake. Also, the sweet stuff is bad for your teeth and we live in such a rich world already; why continuously pursue the unhappy road to happiness, when blessed with happiness already.

So, congratulations again, Antonio, for having had that thrill, but there are plenty of computers out there today who can provide the absolute knowledge whether a big number is a prime or is not a prime. I believe they can figure out a million-digit number within a fraction of a second.

If you want to pursue the other stuff, you know my conditions.

[AntonioLao]

Fredrick,

Merely publishing as you did into a book can be accounted as being patented? I wondered if posting in TOEQUEST is considered equivalent to a published book?

[Fredrick]

Originally Posted by AntonioLao

Fredrick,

Merely publishing as you did into a book can be accounted as being patented? I wondered if posting in TOEQUEST is considered equivalent to a published book?

Hi Antonio,

To publish it is not the same as patenting something, but it does prevent others from patenting the same. The requirement for patenting something is that you must be the source of the information, and that no one else made the same information available previously (also, you must request a patent within one year of making something public). Also, ideas cannot be patented. Products based on ideas can get patented. My patent for the prime number sequence was part of an encryption product to safeguard information (for instance, bank information).

Of interest may be that Agrawal, c.s. decided against patenting the prime numbers algorithm. If you allow me to think negatively, they prevented me that way from undermining them in such an attempt to get a patent for their algorithm. Possibly, they knew they could not get away with a patent. Though my description is not an algorithm itself, it is the same delivery nevertheless, written in such a way any person can understand what is going on without having much math background.

Writing on ToeQuest is not the same as patenting, but it does show who said what first, and prevents others from claiming to be the source of your information. With the internet widely available to anyone, this would make ToeQuest highly valuable in not only transmitting information between people, but also cataloging the various views presented by each. I therefore consider it a safe location to promote ideas and to showcase who we are, but I do not know in how far it would stand up against major players in the world of Fisks; minor players may be copied by the major players and then never heard of again. I guess, it is all part of our evolving world.

Copying the information you placed on the internet, such as a picture from the site with your information (if possible with date) and keeping it in a safe place is important, that way you can show the information was indeed out there for others to read.

[Fredrick]

Antonio,

Since it is summer, I have a quiz posted here for those interested in winning access to my book:

http://www.toequest.com/forum/your-t...html#post61828

There are three ways to win access.

[AntonioLao]

I'm now in the process of submitting a paper to be published in one of the journals of the American Mathematical Society, hoping by January 2009 in JAMS.

[Fredrick]

Originally Posted by AntonioLao

I'm now in the process of submitting a paper to be published in one of the journals of the American Mathematical Society, hoping by January 2009 in JAMS.

Excellent, Antonio,

I hope your paper will get published. Is it, as you wrote, on Fermat's last algorithm on primes factorization?

[AntonioLao]

Originally Posted by Fredrick

on Fermat's last algorithm on primes factorization?

Nobody knows what was Fermat's lost algorithm. But I'm combining Goldbach conjecture with Erdos conjecture and come up with a prime difference for twice a prime. For example, 2=(7-3)/2, 3=(11-5)/2, 5=(13-3)/2, and 7=(17-3)/2. Similar to the infinite numbers of Pythagorean triples, there are also infinite numbers of these.

[Fredrick]

Originally Posted by AntonioLao

Nobody knows what was Fermat's lost algorithm. But I'm combining Goldbach conjecture with Erdos conjecture and come up with a prime difference for twice a prime. For example, 2=(7-3)/2, 3=(11-5)/2, 5=(13-3)/2, and 7=(17-3)/2. Similar to the infinite numbers of Pythagorean triples, there are also infinite numbers of these.

Cool, Antonio.

And if I understood it correctly, your information includes the various way to get the same answer? For instance, 2=(7-3)/2, and 2=(11-7)/2, and 2=(17-13)/2 are all 'the same.'

[AntonioLao]

Thanks, these were derived from combining Goldbach with that of Erdos conjecture. My question is could we use them to create unbreakable encryptions? The fact that there are infinite ways to get the same answers would certainly make it almost impossible for the code breakers to crack.

[Fredrick]

Originally Posted by AntonioLao

Thanks, these were derived from combining Goldbach with that of Erdos conjecture. My question is could we use them to create unbreakable encryptions? The fact that there are infinite ways to get the same answers would certainly make it almost impossible for the code breakers to crack.

I am not certain if I can answer that question positively, Antonio. I know that security encryptions already use systems based on prime numbers, so that would indicate a clear 'yes' to your question. However, if those are based on the same method you propose then that would actually mean 'no, you cannot get a patent on it.'

You need to do a search on encryptions and patenting. It's been a while, but the office of patenting has search sites that allow you to search their data base for what has been patented and for what is going through their patenting process right now. I have no web address for you, so try googling it.

Good luck on this endeavor, Antonio.