Hi fellas..this is my first post here..I am new to this 'hardcore programming' and all..I came across a problem for which I killed some time..with no fruits..It might be simple,trivial or even 'famous' for you guys..Any assistance is appreciated much.So here it goes..

Given an integer,the problem is to find the prime number combination whose product form the number since any integer can be given as a product of one or more primary numbers..

For eg..for 36,the solution would be 2,2,3,3.

Another thing..a pseudo code or algorithmic description is sufficient..thanks again..