UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-03-27 17:50:04 +01:00
Code Issues Packages Projects Releases Wiki Activity

[poincare] Arithmetic::PrimeFactorization return the number of prime

Browse Source 
factors found
This commit is contained in:
Émilie Feral
2018-09-20 13:53:04 +02:00
parent 9ae6a3a9d2
commit 0e1fd1bad7
5 changed files with 22 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
poincare/src/factor.cpp
View File

@@ -62,25 +62,23 @@ Multiplication Factor::createMultiplicationOfIntegerPrimeDecomposition(Integer i
assert(!i.isZero());
assert(!i.isNegative());
Multiplication m;
if (i.isOne()) {
Integer factors[Arithmetic::k_maxNumberOfPrimeFactors];
Integer coefficients[Arithmetic::k_maxNumberOfPrimeFactors];
int numberOfPrimeFactors = Arithmetic::PrimeFactorization(i, factors, coefficients, Arithmetic::k_maxNumberOfPrimeFactors);
if (numberOfPrimeFactors == 0) {
m.addChildAtIndexInPlace(Rational(i), 0, 0);
return m;
}
Integer factors[Arithmetic::k_maxNumberOfPrimeFactors];
Integer coefficients[Arithmetic::k_maxNumberOfPrimeFactors];
Arithmetic::PrimeFactorization(i, factors, coefficients, Arithmetic::k_maxNumberOfPrimeFactors);
int index = 0;
if (coefficients[0].isMinusOne()) {
if (numberOfPrimeFactors < 0) {
// Exception: the decomposition failed
return m;
}
while (!coefficients[index].isZero() && index < Arithmetic::k_maxNumberOfPrimeFactors) {
for (int index = 0; index < numberOfPrimeFactors; index++) {
Expression factor = Rational(factors[index]);
if (!coefficients[index].isOne()) {
factor = Power(factor, Rational(coefficients[index]));
}
m.addChildAtIndexInPlace(factor, m.numberOfChildren(), m.numberOfChildren());
index++;
}
return m;
}