I am looking for numbers $n$ that can be written as the sum of other numbers. So: PowersRepresentations[n, x, 1]. But is there a faster way of finding these numbers? And is there a way to do the same calculation but with multiplication instead of addition?

  • 2
    $\begingroup$ Have you explored IntegerPartitions for the case of addition? $\endgroup$
    – Syed
    Jan 14 at 19:13
  • 2
    $\begingroup$ For the case of multiplication you would need the prime factors $\endgroup$ Jan 14 at 19:39

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.