$n$$(k_1,k_2,...,k_m)$$k_i \geqslant 2$$k_1 \cdot k_2 \cdot ... \cdot k_m = n$

Jika Anda penasaran dari mana asalnya: Dekomposisi ini dikenal sebagai dekomposisi faktor invarian dalam teori bilangan dan digunakan dalam klasifikasi kelompok Abelian yang dihasilkan secara halus.

Tantangan

Diberikan $n$ keluaran semua tupel tersebut $(k_1,k_2,...,k_m)$ untuk $n$ diberikan tepat satu kali, dalam urutan apa pun yang Anda suka. Format output urutan standar diizinkan.

Contohnya

  1: () (empty tuple)
  2: (2)
  3: (3)
  4: (2,2), (4)
  5: (5)
  6: (6)
  7: (7)
  8: (2,2,2), (2,4), (8)
  9: (3,3), (9)
 10: (10)
 11: (11)
 12: (2,6), (12)
108: (2,54), (3,3,12), (3,6,6), (3,36), (6,18), (108)

Terkait: http://oeis.org/A000688 , Daftar semua partisi multiplikasi dari n

Haskell, 66 62 60 byte

f n=[n|n>1]:[k:l:m|k<-[2..n],l:m<-f$div n k,mod(gcd n l)k<1]

Cobalah online!

05AB1E , 13 byte

Òœ€.œP€`êʒüÖP

Cobalah online!

Ò                      # prime factorization of the input
 œ€.œ                  # all partitions
     P                 # product of each sublist
      €`               # flatten
        ê              # sorted uniquified
         ʒ             # filter by:
          üÖ           #  pairwise divisible-by (yields list of 0s or 1s)
            P          #  product (will be 1 iff the list is all 1s)

Jelly , 17 byte

ÆfŒ!Œb€ẎP€€QḍƝẠ$Ƈ

Cobalah online!

JavaScript (V8) ,  73  70 byte

$(k_m,k_{m-1},...,k_1)$

f=(n,d=2,a=[])=>n>1?d>n||f(n,d+1,a,d%a[0]||f(n/d,d,[d,...a])):print(a)

Cobalah online!

Berkomentar

f = (             // f is a recursive function taking:
  n,              //   n   = input
  d = 2,          //   d   = current divisor
  a = []          //   a[] = list of divisors
) =>              //
  n > 1 ?         // if n is greater than 1:
    d > n ||      //   unless d is greater than n,
    f(            //   do a recursive call with:
      n,          //     -> n unchanged
      d + 1,      //     -> d + 1
      a,          //     -> a[] unchanged
      d % a[0] || //     unless the previous divisor does not divide the current one,
      f(          //     do another recursive call with:
        n / d,    //       -> n / d
        d,        //       -> d unchanged
        [d, ...a] //       -> d preprended to a[]
      )           //     end of inner recursive call
    )             //   end of outer recursive call
  :               // else:
    print(a)      //   this is a valid list of divisors: print it

05AB1E , 17 15 14 byte

ѦIиæʒPQ}êʒüÖP

Sangat lambat untuk kasus uji yang lebih besar.

-1 byte terima kasih kepada @Grimy .

Cobalah online.

Penjelasan:

Ñ               # Get all divisors of the (implicit) input-integer
 ¦              # Remove the first value (the 1)
  Iи            # Repeat this list (flattened) the input amount of times
                #  i.e. with input 4 we now have [2,4,2,4,2,4,2,4]
    æ           # Take the powerset of this list
     ʒ  }       # Filter it by:
      PQ        #  Where the product is equal to the (implicit) input
         ê      # Then sort and uniquify the filtered lists
          ʒ     # And filter it further by:
           ü    #  Loop over each overlapping pair of values
            Ö   #   And check if the first value is divisible by the second value
             P  #  Check if this is truthy for all pairs

                # (after which the result is output implicitly)

JavaScript, 115 byte

f=(n,a=[],i=1)=>{for(;i++<n;)n%i||(a=a.concat(f(n/i).filter(e=>!(e[0]%i)).map(e=>[i].concat(e))));return n>1?a:[a]}

Saya akan menulis penjelasan nanti

Bahasa Wolfram (Mathematica) , 78 76 72 71 67 byte

If[#>(p=1##2),Join@@If[i∣##,##~#0~i,{}]~Table~{i,2,#/p},{{##2}}]&

Cobalah online!

Pohon pencarian rekursif.

Solusi brute force, 64 byte :

Union@Cases[Range@#~Tuples~#,{a__,__}/;1a==#&&a>=2&&1∣a:>{a}]&

Modifikasi sepele dari solusi Mathematica saya ke Daftar semua partisi multiplikasi dari n .

Karena ini perlu diperiksa $n^n$tuple, coba versi yang lebih efisien menggunakan logika yang sama .

Japt , 22 bytes

â Åï c à f@¥XשXäv eÃâ

Cobalah

â Åï c à f@¥XשXäv eÃâ     :Implicit input of integer U
â                          :Divisors
  Å                        :Slice off the first element, removing the 1
   ï                       :Cartesian product
     c                     :Flatten
       à                   :Combinations
         f                 :Filter by
          @                :Passing each sub-array X through the following function
           ¥               :  Test U for equality with
            X×             :  X reduced by multiplication
              ©            :  Logical AND with
               Xä          :  Consecutive pairs of X
                 v         :  Reduced by divisibility
                   e       :  All truthy?
                    Ã      :End filter
                     â     :Deduplicate