archive-org.com » ORG » P » PLANETMATH.ORG Total: 488 Choose link from "Titles, links and description words view": Or switch to
"Titles and links view". |

- Finding approximate values of real roots equation. | planetmath.org

34 Forums Graduate Advanced Approximate values of real Permalink Submitted by RKJCHENNAI on Thu 02 11 2016 14 48 http rkmath yolasite com resources Roots 20sum 20and 20multiplication pdf Log in to post comments Deleting Permalink Submitted by akdevaraj on Mon 02 15 2016 11 45 How do we delete a message I clicked on edit then tried to delete but did not succeed Log in to post comments Search

Original URL path: http://www.planetmath.org/comment/20011 (2016-04-25)

Open archived version from archive - RKJCHENNAI | planetmath.org

preamble as your knowledge of TeX increases you will probably want to edit this but it should be fine as is for beginners almost certainly you want these usepackage amssymb usepackage amsmath usepackage amsfonts used for TeXing text within eps files usepackage psfrag need this for including graphics includegraphics usepackage graphicx for neatly defining theorems and propositions usepackage amsthm making logically defined graphics usepackage xypic there are many more packages

Original URL path: http://www.planetmath.org/users/rkjchennai (2016-04-25)

Open archived version from archive - An Indirect Primality Test | planetmath.org

program for a counter example If your argument is correct and I guess it is then it can provide an unprecedented efficient algorithm to test primality since any number can be written under the form x n m and it seems that your test is valid for this general case provided it is for x 2 1 Daniel Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Wed 05 27 2009 09 30 Forget the proof I got it As it happens many times I woke up this morning and eureka It is indeed self evident and I am not going to waste time searching for a counter example which doesn t exist now I am convinced Your test is a real achievement since it works for any polynom of the kind x n m Next week I am going to invest some time in trying to implement a computer algorithm The strategy would be for a given number P to test to find an exponent n such that P x n m and have a minimum of trials on x Any better idea Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Sun 12 20 2009 15 21 Dear Daniel You must forgive me for replying to you so late the fact is I have not been visiting PM for about a year My first q Could you find a counter example Secondly I will be glad if you would try to comprehend failure function terminology In case you succeed then both of us would be talking the same language and so understanding each other would be much easier If required I would be only too happy to explain it Second q My old yahoo id got eaten up by a virus and so I am not able to automatically receive notices mail sent to me by PM members I tried to change my setting but could not what do you suggest Regards A K Devaraj Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Sun 12 20 2009 21 36 Dear Devaraj Apparently you didn t not see my last note about this subject I finally followed your idea using simple polynomial algebra and understood that you are right So I didn t waste time looking for a counter example which doesn t exist now I am convinced While I can understand that failure function theory provides shortcuts to prove many algebra theorems I think that I am too old to learn this subject I am retired and quite busy with other things I think that you should write an entry at PM on this subject for two reasons 1 The test in itself is absolutely remarkable 2 The use of a failure function to prove it shows the power of the theory Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Thu 08

Original URL path: http://www.planetmath.org/comment/20010 (2016-04-25)

Open archived version from archive - An Indirect Primality Test | planetmath.org

program for a counter example If your argument is correct and I guess it is then it can provide an unprecedented efficient algorithm to test primality since any number can be written under the form x n m and it seems that your test is valid for this general case provided it is for x 2 1 Daniel Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Wed 05 27 2009 09 30 Forget the proof I got it As it happens many times I woke up this morning and eureka It is indeed self evident and I am not going to waste time searching for a counter example which doesn t exist now I am convinced Your test is a real achievement since it works for any polynom of the kind x n m Next week I am going to invest some time in trying to implement a computer algorithm The strategy would be for a given number P to test to find an exponent n such that P x n m and have a minimum of trials on x Any better idea Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Sun 12 20 2009 15 21 Dear Daniel You must forgive me for replying to you so late the fact is I have not been visiting PM for about a year My first q Could you find a counter example Secondly I will be glad if you would try to comprehend failure function terminology In case you succeed then both of us would be talking the same language and so understanding each other would be much easier If required I would be only too happy to explain it Second q My old yahoo id got eaten up by a virus and so I am not able to automatically receive notices mail sent to me by PM members I tried to change my setting but could not what do you suggest Regards A K Devaraj Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Sun 12 20 2009 21 36 Dear Devaraj Apparently you didn t not see my last note about this subject I finally followed your idea using simple polynomial algebra and understood that you are right So I didn t waste time looking for a counter example which doesn t exist now I am convinced While I can understand that failure function theory provides shortcuts to prove many algebra theorems I think that I am too old to learn this subject I am retired and quite busy with other things I think that you should write an entry at PM on this subject for two reasons 1 The test in itself is absolutely remarkable 2 The use of a failure function to prove it shows the power of the theory Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Thu 08

Original URL path: http://www.planetmath.org/comment/20009 (2016-04-25)

Open archived version from archive - An Indirect Primality Test | planetmath.org

program for a counter example If your argument is correct and I guess it is then it can provide an unprecedented efficient algorithm to test primality since any number can be written under the form x n m and it seems that your test is valid for this general case provided it is for x 2 1 Daniel Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Wed 05 27 2009 09 30 Forget the proof I got it As it happens many times I woke up this morning and eureka It is indeed self evident and I am not going to waste time searching for a counter example which doesn t exist now I am convinced Your test is a real achievement since it works for any polynom of the kind x n m Next week I am going to invest some time in trying to implement a computer algorithm The strategy would be for a given number P to test to find an exponent n such that P x n m and have a minimum of trials on x Any better idea Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Sun 12 20 2009 15 21 Dear Daniel You must forgive me for replying to you so late the fact is I have not been visiting PM for about a year My first q Could you find a counter example Secondly I will be glad if you would try to comprehend failure function terminology In case you succeed then both of us would be talking the same language and so understanding each other would be much easier If required I would be only too happy to explain it Second q My old yahoo id got eaten up by a virus and so I am not able to automatically receive notices mail sent to me by PM members I tried to change my setting but could not what do you suggest Regards A K Devaraj Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Sun 12 20 2009 21 36 Dear Devaraj Apparently you didn t not see my last note about this subject I finally followed your idea using simple polynomial algebra and understood that you are right So I didn t waste time looking for a counter example which doesn t exist now I am convinced While I can understand that failure function theory provides shortcuts to prove many algebra theorems I think that I am too old to learn this subject I am retired and quite busy with other things I think that you should write an entry at PM on this subject for two reasons 1 The test in itself is absolutely remarkable 2 The use of a failure function to prove it shows the power of the theory Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Thu 08

Original URL path: http://www.planetmath.org/comment/20006 (2016-04-25)

Open archived version from archive - An Indirect Primality Test | planetmath.org

program for a counter example If your argument is correct and I guess it is then it can provide an unprecedented efficient algorithm to test primality since any number can be written under the form x n m and it seems that your test is valid for this general case provided it is for x 2 1 Daniel Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Wed 05 27 2009 09 30 Forget the proof I got it As it happens many times I woke up this morning and eureka It is indeed self evident and I am not going to waste time searching for a counter example which doesn t exist now I am convinced Your test is a real achievement since it works for any polynom of the kind x n m Next week I am going to invest some time in trying to implement a computer algorithm The strategy would be for a given number P to test to find an exponent n such that P x n m and have a minimum of trials on x Any better idea Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Sun 12 20 2009 15 21 Dear Daniel You must forgive me for replying to you so late the fact is I have not been visiting PM for about a year My first q Could you find a counter example Secondly I will be glad if you would try to comprehend failure function terminology In case you succeed then both of us would be talking the same language and so understanding each other would be much easier If required I would be only too happy to explain it Second q My old yahoo id got eaten up by a virus and so I am not able to automatically receive notices mail sent to me by PM members I tried to change my setting but could not what do you suggest Regards A K Devaraj Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Sun 12 20 2009 21 36 Dear Devaraj Apparently you didn t not see my last note about this subject I finally followed your idea using simple polynomial algebra and understood that you are right So I didn t waste time looking for a counter example which doesn t exist now I am convinced While I can understand that failure function theory provides shortcuts to prove many algebra theorems I think that I am too old to learn this subject I am retired and quite busy with other things I think that you should write an entry at PM on this subject for two reasons 1 The test in itself is absolutely remarkable 2 The use of a failure function to prove it shows the power of the theory Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Thu 08

Original URL path: http://www.planetmath.org/comment/20007 (2016-04-25)

Open archived version from archive - An Indirect Primality Test | planetmath.org

program for a counter example If your argument is correct and I guess it is then it can provide an unprecedented efficient algorithm to test primality since any number can be written under the form x n m and it seems that your test is valid for this general case provided it is for x 2 1 Daniel Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Wed 05 27 2009 09 30 Forget the proof I got it As it happens many times I woke up this morning and eureka It is indeed self evident and I am not going to waste time searching for a counter example which doesn t exist now I am convinced Your test is a real achievement since it works for any polynom of the kind x n m Next week I am going to invest some time in trying to implement a computer algorithm The strategy would be for a given number P to test to find an exponent n such that P x n m and have a minimum of trials on x Any better idea Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Sun 12 20 2009 15 21 Dear Daniel You must forgive me for replying to you so late the fact is I have not been visiting PM for about a year My first q Could you find a counter example Secondly I will be glad if you would try to comprehend failure function terminology In case you succeed then both of us would be talking the same language and so understanding each other would be much easier If required I would be only too happy to explain it Second q My old yahoo id got eaten up by a virus and so I am not able to automatically receive notices mail sent to me by PM members I tried to change my setting but could not what do you suggest Regards A K Devaraj Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Sun 12 20 2009 21 36 Dear Devaraj Apparently you didn t not see my last note about this subject I finally followed your idea using simple polynomial algebra and understood that you are right So I didn t waste time looking for a counter example which doesn t exist now I am convinced While I can understand that failure function theory provides shortcuts to prove many algebra theorems I think that I am too old to learn this subject I am retired and quite busy with other things I think that you should write an entry at PM on this subject for two reasons 1 The test in itself is absolutely remarkable 2 The use of a failure function to prove it shows the power of the theory Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Thu 08

Original URL path: http://www.planetmath.org/comment/20008 (2016-04-25)

Open archived version from archive - An Indirect Primality Test | planetmath.org

program for a counter example If your argument is correct and I guess it is then it can provide an unprecedented efficient algorithm to test primality since any number can be written under the form x n m and it seems that your test is valid for this general case provided it is for x 2 1 Daniel Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Wed 05 27 2009 09 30 Forget the proof I got it As it happens many times I woke up this morning and eureka It is indeed self evident and I am not going to waste time searching for a counter example which doesn t exist now I am convinced Your test is a real achievement since it works for any polynom of the kind x n m Next week I am going to invest some time in trying to implement a computer algorithm The strategy would be for a given number P to test to find an exponent n such that P x n m and have a minimum of trials on x Any better idea Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Sun 12 20 2009 15 21 Dear Daniel You must forgive me for replying to you so late the fact is I have not been visiting PM for about a year My first q Could you find a counter example Secondly I will be glad if you would try to comprehend failure function terminology In case you succeed then both of us would be talking the same language and so understanding each other would be much easier If required I would be only too happy to explain it Second q My old yahoo id got eaten up by a virus and so I am not able to automatically receive notices mail sent to me by PM members I tried to change my setting but could not what do you suggest Regards A K Devaraj Log in to post comments Re An Indirect Primality Test Permalink Submitted by dh2718 on Sun 12 20 2009 21 36 Dear Devaraj Apparently you didn t not see my last note about this subject I finally followed your idea using simple polynomial algebra and understood that you are right So I didn t waste time looking for a counter example which doesn t exist now I am convinced While I can understand that failure function theory provides shortcuts to prove many algebra theorems I think that I am too old to learn this subject I am retired and quite busy with other things I think that you should write an entry at PM on this subject for two reasons 1 The test in itself is absolutely remarkable 2 The use of a failure function to prove it shows the power of the theory Log in to post comments Re An Indirect Primality Test Permalink Submitted by akdevaraj on Thu 08

Original URL path: http://www.planetmath.org/comment/20004 (2016-04-25)

Open archived version from archive