I have forgotten
my Password

Or login with:

  • Facebookhttp://facebook.com/
  • Googlehttps://www.google.com/accounts/o8/id
  • Yahoohttps://me.yahoo.com
get GPL
COST (GBP)
this unit 0.50
sub units 0.00
+
0

Factorize

Calculates the decomposition of a positive integer into primes.
Controller: CodeCogs

get GPL add to cart

Interface

C++

Factorize

 
std::vector<factor>factorizeunsigned intn )
This functions calculates the unique factorization of a positive number into a product of primes raised to certain powers.

Example:

#include <codecogs/maths/discrete/number_theory/factorize.h>
#include <iostream>
int main()
{
  std::vector<factor> result = Maths::Discrete::NumberTheory::factorize(123456);
  std::cout << "The factorization of 123456 into primes is" << std::endl;
  for (int i = 0; i < result.size(); i++)
    std::cout << result[i].value << "^" << result[i].power << "  ";
  std::cout << std::endl;
  return 0;
}

Output:

The factorization of 123456 into primes is
2^6  3^1  643^1

Returns

the prime factorization of n

Authors

Lucian Bentea (August 2005)
Source Code

Source code is available when you agree to a GP Licence or buy a Commercial Licence.

Not a member, then Register with CodeCogs. Already a Member, then Login.


Other Documentation

Detailed Description...
Source Code

Source code is available when you agree to a GP Licence or buy a Commercial Licence.

Not a member, then Register with CodeCogs. Already a Member, then Login.