Over a million developers have joined DZone.
{{announcement.body}}
{{announcement.title}}

DZone's Guide to

# Prime Factor Decomposition of a Number

· Web Dev Zone ·
Free Resource

Comment (0)

Save
{{ articles[0].views | formatCount}} Views

Classify programming languages: Build a model that predicts a code's programming language based on its text.  Content provided by IBM Developer.

The following function computes the prime factors (PFs) of an integer.

```from math import floor

def factors(n):
result = []
for i in range(2,n+1): # test all integers between 2 and n
s = 0;
while n/i == floor(n/float(i)): # is n/i an integer?
n = n/float(i)
s += 1
if s > 0:
for k in range(s):
result.append(i) # i is a pf s times
if n == 1:
return result

# test
print factors(90)```

The result will be

[2, 3, 3, 5]

This means that 90 is equal to 2*3*3*5.

Start coding something amazing with our library of open source Cloud code patterns. Content provided by IBM.

Topics:

Comment (0)

Save
{{ articles[0].views | formatCount}} Views

Published at DZone with permission of

Opinions expressed by DZone contributors are their own.

### {{ parent.tldr }}

{{ parent.urlSource.name }}