How to resolve the algorithm Product of min and max prime factors step by step in the J programming language

Published on 12 May 2024 09:40 PM
#J

How to resolve the algorithm Product of min and max prime factors step by step in the J programming language

Table of Contents

Problem Statement

Exactly as the task title implies.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Product of min and max prime factors step by step in the J programming language

Source code in the j programming language

   1>.(>./*<./)@q:"0 >:i.10 10
   1  4    9  4 25  6   49  4    9 10
 121  6  169 14 15  4  289  6  361 10
  21 22  529  6 25 26    9 14  841 10
 961  4   33 34 35  6 1369 38   39 10
1681 14 1849 22 15 46 2209  6   49 10
  51 26 2809  6 55 14   57 58 3481 10
3721 62   21  4 65 22 4489 34   69 14
5041  6 5329 74 15 38   77 26 6241 10
   9 82 6889 14 85 86   87 22 7921 10
  91 46   93 94 95  6 9409 14   33 10


   1>.({.*{:)@q:"0 >:i.10 10
   1  4    9  4 25  6   49  4    9 10
 121  6  169 14 15  4  289  6  361 10
  21 22  529  6 25 26    9 14  841 10
 961  4   33 34 35  6 1369 38   39 10
1681 14 1849 22 15 46 2209  6   49 10
  51 26 2809  6 55 14   57 58 3481 10
3721 62   21  4 65 22 4489 34   69 14
5041  6 5329 74 15 38   77 26 6241 10
   9 82 6889 14 85 86   87 22 7921 10
  91 46   93 94 95  6 9409 14   33 10

You may also check:How to resolve the algorithm Pascal's triangle step by step in the Seed7 programming language
You may also check:How to resolve the algorithm Determinant and permanent step by step in the 360 Assembly programming language
You may also check:How to resolve the algorithm Euler's sum of powers conjecture step by step in the BASIC programming language
You may also check:How to resolve the algorithm Arithmetic/Complex step by step in the APL programming language
You may also check:How to resolve the algorithm I before E except after C step by step in the R programming language