The tag has no usage guidance.

learn more… | top users | synonyms

9
votes
0answers
696 views

Does Mathematica use the Elliptic Curve Method (ECM) in FactorInteger[]?

I'm not a mathematician, and I'm not even going to pretend that I understand anything of the ECM. But I know it can be a fast method for factorization. I benchmarked the factorization of ...
3
votes
0answers
64 views

Explicitly find a guaranteed factorization of large expression?

Consider the large expression LE defined in this file (involving only linearly independent functions), or in this file (linear interdependence present but slightly ...
3
votes
0answers
661 views

Extract common factor from vector or matrix

I can't believe this hasn't been asked before but I can't find anything. Is there a way to convince Simplify or FullSimplify to ...
1
vote
0answers
36 views

Factoring rationals from equation based on digit complexity?

Consider an equation of the following type: ( poly = (3 x)/35 + (6 y)/7 ) == 0 If we apply the command Factor to this ...
1
vote
0answers
55 views

decomposing an expression into absolutely positive terms

I have a big ugly expression which, for unimportant (here) reasons, must be greater than or equal to zero. It is formed from terms which themselves are greater than or equal to zero. As such it ...
1
vote
0answers
384 views

Polynomial factorization over finite fields with non-prime order

One can easily factor a polynomial over finite fields of prime order, using Factor command: ...
0
votes
0answers
44 views

Efficiently create a list of factors of consecutive integers

I'm interested in a scalable (read: sublinear) algorithm for producing the list of integer factors of each integer from 1 to n. ...
0
votes
0answers
32 views

ApartSquareFree function

I have a doubt concerning the ApartSquareFree function in Mathematica. Roughly speaking, it is supposed to compute the partial fraction decomposition of a rational function $h/g$ with the denominators ...
0
votes
0answers
57 views

Factor Integer function with variable arguments

I'm trying to build a function that gives the highest power of a prime factor of a number. The following works perfectly: ...