How to resolve the algorithm Composite numbers k with no single digit factors whose factors are all substrings of k step by step in the J programming language

Published on 12 May 2024 09:40 PM
#J

How to resolve the algorithm Composite numbers k with no single digit factors whose factors are all substrings of k step by step in the J programming language

Table of Contents

Problem Statement

Find the composite numbers k in base 10, that have no single digit prime factors and whose prime factors are all a substring of k.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Composite numbers k with no single digit factors whose factors are all substrings of k step by step in the J programming language

Source code in the j programming language

  */2 3 5 7
210
   #1+I.0=+/|:4 q:1+i.210
48


   2{._10 ]\(#~ */"1@((+./@(E. '0 ',])~&>)&:(":&.>)q:))(#~ 1-1&p:)}.,(1+I.0=+/|:4 q:1+i.210)+/~210*i.2e5
  15317    59177    83731   119911   183347   192413  1819231  2111317  2237411  3129361
5526173 11610313 13436683 13731373 13737841 13831103 15813251 17692313 19173071 28118827

You may also check:How to resolve the algorithm Keyboard input/Obtain a Y or N response step by step in the Z80 Assembly programming language
You may also check:How to resolve the algorithm Determine if a string is numeric step by step in the Quackery programming language
You may also check:How to resolve the algorithm Juggler sequence step by step in the Ada programming language
You may also check:How to resolve the algorithm Bulls and cows step by step in the UNIX Shell programming language
You may also check:How to resolve the algorithm Ruth-Aaron numbers step by step in the Nim programming language