function simple_decomp, x

;+ Decomposition of an integer number into simple numbers
;-

j = long(sqrt(x))

repeat j = j-1 until (x mod j eq 0) or (j le 2)

div = [j, x/j]

y = j

	for second = 0,1 do begin

loop:

j = 1L

repeat j = j+1 until (y mod j eq 0) or (j ge div[0])

if (y mod j eq 0) then div = [div, j]

	if (j lt div[0]) then begin
	y = y / j
	goto, loop
	endif

div = div[1:*]
y = div[0]

	endfor

div = div[sort(div)]

return, div

end