Hey Happy Wednesday, everyone!! And what a wonderful Wednesday it has been! I spent this morning doing some final preparations for a presentation that I had to give about the education system in Peru. It was a fascinating investigation for me, and the presentation went well!
[And, I know you're dying to know what the education system in Peru is like. The best thing about the Peruvian education system is that there is hope that it can improve. Honestly, right now, things aren't very good. But there is a lot of potential, and I pray that people with vision and passion would step up and take a whack at making some changes.]
After class, I went to Colegio Claretiano to observe an English class!!
And then I had a bit of time at home to do some final preparations for my presentation for Didactica de las Matematicas where I had to give a mock 5th grade lesson about... Prime Factorization!!
And now, I'm at home, and I'm currently taking a break from preparing for a presentation that I am going to give tomorrow about my time at Colegio Claretiano. As I type this, I realize that it sounds like all that I have been doing lately is give presentations! But, it really hasn't been as much work as it sounds. The presentations have been quite enjoyable to prepare for, actually! Horray!
This is the best idea about integer factorization, written here is to let more people know and participate.
ReplyDeleteA New Way of the integer factorization
1+2+3+4+……+k=Ny,(k<N/2),"k" and "y" are unknown integer,"N" is known Large integer.
True gold fears fire, you can test 1+2+3+...+k=Ny(k<N/2).
How do I know "k" and "y"?
"P" is a factor of "N",GCD(k,N)=P.
Two Special Presentation:
N=5287
1+2+3+...k=Ny
Using the dichotomy
1+2+3+...k=Nrm
"r" are parameter(1;1.25;1.5;1.75;2;2.25;2.5;2.75;3;3.25;3.5;3.75)
"m" is Square
(K^2+k)/(2*4)=5287*1.75 k=271.5629(Error)
(K^2+k)/(2*16)=5287*1.75 k=543.6252(Error)
(K^2+k)/(2*64)=5287*1.75 k=1087.7500(Error)
(K^2+k)/(2*256)=5287*1.75 k=2176(OK)
K=2176,y=448
GCD(2176,5287)=17
5287=17*311
N=13717421
1+2+3+...+k=13717421y
K=4689099,y=801450
GCD(4689099,13717421)=3803
13717421=3803*3607
The idea may be a more simple way faster than Fermat's factorization method(x^2-N=y^2)!
True gold fears fire, you can test 1+2+3+...+k=Ny(k<N/2).
More details of the process in my G+ and BLOG.
My G+ :https://plus.google.com/u/0/108286853661218386235/posts
My BLOG:http://hi.baidu.com/s_wanfu/item/00cd4d3c5a2fd089f5e4ad0a
Email:wanfu.sun@gmail.com