![]() |
|
|
#1 |
|
Dec 2010
2×37 Posts |
Hello,
Is there a specific test for any given integer that determines its number of prime factors? (Aside from actually finding the actual factors...) Examples: F(10) = 2 F(16) = 4 F(17) = 1 F(110) = 3 |
|
|
|
|
|
#2 |
|
Romulan Interpreter
Jun 2011
Thailand
965310 Posts |
No, there is not. And F(16)=1, according with your definition.
|
|
|
|
|
|
#3 |
|
Nov 2003
22×5×373 Posts |
|
|
|
|
|
|
#4 |
|
"Forget I exist"
Jul 2009
Dumbassville
26×131 Posts |
I think everyone sees that the definition is inconsistent because f(10)=2 10 has 2 and 5 as prime factors, but 16 = 2^4 has only 1 prime factor namely 2 so it doesn't fit in with the previous line F(17)=1 also only seems to make sense to me if it's prime factors because a prime has but 1 prime factor namely itself. Also contrary to what RDS might say 10 doesn't fit x^2 for any whole number x
Last fiddled with by science_man_88 on 2011-12-19 at 16:22 |
|
|
|
|
|
#5 |
|
"Forget I exist"
Jul 2009
Dumbassville
26×131 Posts |
|
|
|
|
|
|
#6 |
|
Dec 2008
you know...around...
2×5×67 Posts |
The only thing that comes to my mind is, that if N is not prime (simple PRP-test) and you have trial divided further than N^(1/3) without finding a factor, then you can say that N has two factors without actually finding them.
But that's all. Last fiddled with by mart_r on 2011-12-19 at 18:04 Reason: +"without finding a factor" |
|
|
|
|
|
#7 |
|
"Forget I exist"
Jul 2009
Dumbassville
26×131 Posts |
only thing I can give based on what RDS has found is F(x*y)=F(x)+F(y) but this doesn't help unless you know a factorization already in which case you know if it's prime or not already.
Last fiddled with by science_man_88 on 2011-12-20 at 01:05 |
|
|
|
|
|
#8 | |
|
Romulan Interpreter
Jun 2011
Thailand
72·197 Posts |
Quote:
Does 9 have one prime factor, or two? Does 75 have 2 prime factors, or 3? Maybe English math is different then the math I have learned**. Did you read his post? Or you did not find anybody to tease now, and you started with me? ![]() ** that was not rhetorical, for example, I always had trouble to understand the concept of "proper" divisor in English, as "1" is considered to be "proper" divisor. All definitions of aliquot sequences say "the sum of all proper divisors", where also "1" is summed. So, the English math considers only the number itself to be un-proper. But 1 divides any number, so, it is not proper to nothing. How do you call the divisors of a number which are not 1 and not the number itself? "Not-trivial" divisors? But in that case, any even number has the factor 2, which is also "trivial". etc. etc. The discussion is endless. In my language a "proper" divisor is that one which is not "1" and not the number itself. That I have learned in elementary math. Last fiddled with by LaurV on 2011-12-20 at 04:08 |
|
|
|
|
|
|
#9 | ||
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
24·389 Posts |
Quote:
"The number of unique prime factors" would mean that nine has one i.e. 3. "The number of unique divisors" would mean that nine has three i.e. 1, 3 and 9. "The number of prime factors" (perhaps this one is not well defined) would mean that nine has two i.e. 3 and 3. Quote:
|
||
|
|
|
|
|
#10 |
|
Romulan Interpreter
Jun 2011
Thailand
226658 Posts |
Thanks retina. So, 75 has 3 prime factors, 3, 5, and... 5. And 1 is a divisor which is "proper" to any number. Got it :P
And again, how do you call (in a word) all the divisors of a number (by the way, divisor means "not necessarily prime", see pari function with the same name) except 1 and the number itself?? For example, for 24, this set is {2,3,4,6,8,12}. These I would call proper divisors, in my language. As every number is divisible by 1 and by the number itself, these divisors are not proper. A prime is a number without proper divisors. These definitions are translated mot-a-mot from an elementary arithmetics book in my language. By the same book, "factor" is always prime, a construction like "prime factor" is pleonastic. Of course, you will agree that all this discussion is just for the sake of the discussion itself. But I still would like to get an answer for the question. Is there any word in English math to describe the set of all divisors, except 1 and the number itself? Beside of "non-trivial", or its relatives, as the term "trivial" is in itself more confusing: 2 is a trivial factor of any even number, same as 5 is a trivial factor of any number ending in 0 or 5, because you can see that factor in a blink of an eye, so it is "trivial"... As 64 is a trivial square root of 2 (mod 2^11-1). Last fiddled with by LaurV on 2011-12-20 at 04:56 |
|
|
|
|
|
#11 | |
|
Nov 2003
22·5·373 Posts |
Quote:
to his definition. But he DID NOT GIVE a definition. I pointed out that there was a very consistent way to define F. This function is known as It counts prime factors with MULTIPLICITY. It is different from I said that your assertion was wrong and it was. It is clear that it was you who failed to read the post, otherwise you would not claim that a definition was given when one was not. And your accusation that I was looking for someone to tease is way off base. |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Primality test based on factorization of n^2+n+1 | carpetpool | Miscellaneous Math | 5 | 2018-02-05 05:20 |
| Factorization and primality test O([log_9(N)]^3) | Alberico Lepore | Alberico Lepore | 26 | 2017-12-17 18:44 |
| Blend test is failing on FFT length 1120k every time | Unregistered | Information & Answers | 0 | 2011-12-05 02:07 |
| Unfixing FFT length for LL test | tichy | Software | 2 | 2011-01-12 21:18 |
| Does the LL test:s factorization save or waste CPU time? | svempasnake | Software | 42 | 2002-10-24 19:27 |