What the puzzle wants is the prime numbers from a list of numbers, for example: (33, 66, 72) and wants you to find all the prime
numbers that are factors of those numbers. The primes from my example is: (2, 3, 11). Then it wants the numbers that contain the
primes added together next to the primes.
Example: (2 66+72)(3 33+66+72)(11 33+66)
Output Example: "(2 138)(3 171)(11 99)"
The input format varies depending on the language. In Go one must return a format output given for this language in the description, which is a string, like the function's signature indicates. In (3 27), 27 comes from 12 + 15 because both are multiples of 3, this is what the task is all about.
Can someone provide more context on the problem description? Im am trying to do this problem in Golang and:
the tests are compared to a string "(2 12)(3 27)(5 15)" when from the description it should be an array of arrays?
I get finding the prime numbers but dont quite understand the sum piece. How did we get (3 27) as part of the result for [12,15] specifically where did this 27 come from?
What the puzzle wants is the prime numbers from a list of numbers, for example: (33, 66, 72) and wants you to find all the prime
numbers that are factors of those numbers. The primes from my example is: (2, 3, 11). Then it wants the numbers that contain the
primes added together next to the primes.
Example: (2 66+72)(3 33+66+72)(11 33+66)
Output Example: "(2 138)(3 171)(11 99)"
The input format varies depending on the language. In Go one must return a format output given for this language in the description, which is a string, like the function's signature indicates. In (3 27), 27 comes from 12 + 15 because both are multiples of 3, this is what the task is all about.
Can someone provide more context on the problem description? Im am trying to do this problem in Golang and:
This comment is hidden because it contains spoiler information about the solution