Extract( ) and Count( ).

[lvl107]

  Hello, Everyone.

or

  Is there a way to create a program function as the above ?

     Thanks in advance for your time and help.

         Regards.

Message was edited by: Loi Le

[Werner_E · Accepted solution]

Would this help?

[lvl107]

This Program Function Model is very, very helpful to me, Werner. Thanks and thanks, again.

    Best Regards

[Werner_E]

I doubt that the function "count" will be of any help if you try to get hold on the prime factors of a number and their multiplicity.

As I am not aware of any method to be able to use the results of the symbolic "factor" command, we would have to write our own routine.

This is not that difficult, but slower and you will run into the same problem with larger numbers as before because of the well known limitations given by the numerics.

One way around could be to symbolically evaluate the function, but be prepared that it massively slows down calculation speed!

I am not sure why. The way to find the factors is a very bold and inefficient one (trying every odd number up to the root) and sure could be significantly speeded up by using a vector of precalculated primes, but there seems to be something else which slows down symbolic evaluation that massive.

I could not wait until the facorization of your original number finishes, but I guess you would get the correct result - some day.

Werner

[lvl107]

        Regards.

           Loi.

[Werner_E]

Happy New Year, too, and good luck for 2016!

Werner

EDIT: