20050914, 22:47  #1 
Jun 2003
1605_{10} Posts 
Factoring program need help
I am looking for a program to trial factors numbers of the form a^b1 and a^b+1, I am just interested in small factors. But a and b can extend to 2^32.
Does anyone have such a program or can prime95 be used or can LUigi's program be modified. OR can some one write a program. Citrix 
20050914, 23:51  #2 
"Mark"
Apr 2003
Between here and the
2×7^{2}×71 Posts 
The software you use depends upon a and b. Are either one fixed? Is there a relationship between a and b, such as a=b or a=2b? Are there ranges for a and/or b?

20050915, 00:47  #3 
Jun 2003
645_{16} Posts 
I am intrested in a^a+1 and a^a1 right now, but I might want to work on other numbers in the future.
See http://www.mersenneforum.org/showthr...newpost&t=4631 Citrix Last fiddled with by Citrix on 20050915 at 00:57 
20050915, 01:28  #4 
Jun 2003
3×5×107 Posts 
a^a1/a1 and a^a+1/a+1 with 'a' prime.

20050915, 12:31  #5 
Aug 2002
Buenos Aires, Argentina
10111010100_{2} Posts 
In order to factor these numbers you should first check whether they have an Aurifeuillian factorization. In that way you crack the number in two chunks of about the same size.
For example, using my applet I found in less than 2 minutes (the big prime primality test time) that 211^211 + 1 = 2 ^ 2 x 53 x 213533 x 579407 x 46 406435 349739 x 88 525902 868092 421204 996157 621808 213014 430014 887767 787743 522503 906242 008512 782503 486118 533512 785146 944720 236634 198021 697609 675117 546179 913655 039907 037975 383744 841612 298481 628994 717733 023250 894952 744819 673093 770812 846672 408282 803763 x 246130 193292 807764 953953 811304 965911 556521 721296 069333 564773 431021 734072 101197 483068 800029 533398 117737 335047 117109 076449 501012 926929 386556 396394 504228 200372 562141 045456 832277 553849 852215 431729 464846 531770 078309 936467 281716 435936 267853 (Composite) Notice the big prime number that could not be found if the Aurifeuillian process were not done. 
20050915, 12:54  #6 
Aug 2002
Buenos Aires, Argentina
2^{2}×373 Posts 
In general, for p prime, there is an Aurifeuillian factorization for:
p^{[i]p[/i]} + 1 if p mod 4 = 3 p^{[i]p[/i]}  1 if p mod 4 = 1 
20050915, 18:45  #7 
Jun 2003
3105_{8} Posts 
Thanks alot, that reduces alot of work for me.

20050916, 00:53  #8 
Jun 2003
3×5×107 Posts 
Rogue,
Would you be willing to write a sieving software? http://www.mersenneforum.org/showthr...1131#post61131 Citrix 
20050916, 02:31  #9  
Jun 2003
3·5·107 Posts 
Quote:
Thanks anyway. Citrix 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
The P1 factoring CUDA program  firejuggler  GPU Computing  753  20201212 18:07 
A small factoring program  Yamato  Factoring  2  20071121 23:29 
Where is a factoring program?  Siemelink  Software  2  20060110 20:30 
Factoring Program  HarvestMoon  Factoring  9  20050915 01:42 
Factoring program  ET_  Programming  3  20031125 02:57 