mabe someone can help me with this code:(adsbygoogle = window.adsbygoogle || []).push({});

i have this code, basically first i factorize for example the number 28 to: [2,2,7] and then i make a list of prime numbers and find the index of each factor in that list, so 2 is prime number with index 0 and 7 prime number with index 2 so it ends up like this: [[0],[0],[2]] with which another recursion would be: [[0],[0],[[0]]] which tranlated to binary would be: 1101101110111

but im stuck on this:

Code (Ruby):

require 'prime'

def f(n)

Prime.prime_division(n).flat_map { |factor, power| [factor] * power }

end

n=rand(10000)

puts n

f=f (n)

require 'prime'

@list=Prime.take(10000)

g=[]

j=0

f.each do |j|

if j>10

i=f(@list.index(j))

g.push i

i=[]

else

g.push j

end

end

print g

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Ruby recursive factorization

Have something to add?

Draft saved
Draft deleted

**Physics Forums | Science Articles, Homework Help, Discussion**