smallest K such that number of arrangements of prime factors of K equals N?

Правка en3, от pabloskimg, 2018-10-28 19:15:30

Basically the title. The problem statement can be found here. No idea how to solve it efficiently.

UPDATE: why the downvotes?

Теги #math, #combinatorics, #primes

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en6 Английский pabloskimg 2018-10-29 20:56:46 125
en5 Английский pabloskimg 2018-10-29 20:46:41 4 Tiny change: 'r)!}{k_1! + ... + k_r!} < 2' -> 'r)!}{k_1! * ... * k_r!} < 2'
en4 Английский pabloskimg 2018-10-29 20:45:40 605 Tiny change: '_r$ ($k_i >= k_j$ for ' -> '_r$ ($k_i \geq k_j$ for '
en3 Английский pabloskimg 2018-10-28 19:15:30 30 Tiny change: 'ficiently.' -> 'ficiently.\n\nUPDATE: why the downvotes?'
en2 Английский pabloskimg 2018-10-27 17:43:02 1
en1 Английский pabloskimg 2018-10-27 17:41:36 227 Initial revision (published)