mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2011-07-19, 12:28   #1
JohnFullspeed
 
May 2011
France

7·23 Posts
Default Number of factors

Is there a way to ow howman priimes factor MAXIMUM can have a value


For exemple ea value with 20 digits can hava how many primes facctor

The diggits number, the root....
Thanks
JohnFullspeed is offline   Reply With Quote
Old 2011-07-19, 12:55   #2
Gammatester
 
Gammatester's Avatar
 
Mar 2009

2×19 Posts
Default

[\log_2(n)] if your number is n, i.e. for a 20 decimal digit number [\log_2(10^{20}-1)] = 66. If you want different prime factors, search the largest product of the first primes that is <= n and count the factors:

10^20-2*3*5*7*11*13*17*19*23*29*31*37*41*43*47*53 > 0
10^20-2*3*5*7*11*13*17*19*23*29*31*37*41*43*47*53*59 < 0

Therefore you can have a maximum of 16 different prime factors.

Last fiddled with by Gammatester on 2011-07-19 at 13:12
Gammatester is offline   Reply With Quote
Old 2011-07-19, 15:03   #3
JohnFullspeed
 
May 2011
France

7×23 Posts
Default Prrimess Factor

Thanks

It was just to set the size of and array...
John

Last fiddled with by JohnFullspeed on 2011-07-19 at 15:03
JohnFullspeed is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Number of distinct prime factors of a Double Mersenne number aketilander Operazione Doppi Mersennes 1 2012-11-09 21:16
Estimating the number of prime factors a number has henryzz Math 7 2012-05-23 01:13
Number of Factors for a Mersenne Number kurtulmehtap Math 12 2010-05-03 14:02
42-bit simulalted QC factors a 14-bit number retina Hardware 3 2010-03-31 12:59
Number of factors grandpascorpion Math 5 2005-03-03 17:17

All times are UTC. The time now is 16:03.


Mon Aug 2 16:03:40 UTC 2021 up 10 days, 10:32, 0 users, load averages: 1.78, 2.02, 2.14

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.