mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > MattcAnderson

Reply
 
Thread Tools
Old 2021-06-14, 01:28   #1
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

2×3×151 Posts
Default [found it] want curve fit

I have a question for all you mathematics and computer programming experts.

Note that the 'proper divisors' of a positive integers
are the divisors of that integer including one and excluding the integer itself.

We want to find patterns in the ProperDivisors() function.

count of Proper Divisors
any single prime has a single proper divisor and it is one.

b [count of proper Divisors(b)] relavent expression

0 2 p0^2
1 5 p0^2*p1
2 11 p0^2*P1*p2
3 23 p0^2*p1*p2*p3
4 47 p0^2*p1*p2*p3*p4
5 143 ----------------------- p0^2*p1*p2*p3*p4*p5 so 3^2*5*7*11*13*17
6 191
7 383

this last data point is more than a one hundred second calculation.

What is the curve fit expression for this dateset?

Regards,
Matt

Last fiddled with by retina on 2021-06-14 at 14:04 Reason: Letting everyone know your found it
MattcAnderson is offline   Reply With Quote
Old 2021-06-14, 01:32   #2
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

38A16 Posts
Default

Nevermind. I got it.


b(n) = 2*b(n-1) + 1.

Not easy.

Matt
MattcAnderson is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
the learning curve SELROC Lounge 34 2019-07-31 21:33
Lucky gmp-ecm curve... WraithX GMP-ECM 4 2009-01-12 16:29
Work Per ECM Curve wblipp GMP-ECM 8 2008-12-28 14:24
Why does it do only one curve? Andi47 GMP-ECM 6 2006-03-19 06:38
Curve Counts Prime95 Factoring 23 2005-03-22 16:43

All times are UTC. The time now is 02:58.


Fri Oct 22 02:58:21 UTC 2021 up 90 days, 21:27, 1 user, load averages: 1.83, 1.68, 1.79

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.