How to resolve the algorithm Super-d numbers step by step in the 11l programming language

Published on 12 May 2024 09:40 PM
#11l

How to resolve the algorithm Super-d numbers step by step in the 11l programming language

Table of Contents

Problem Statement

A super-d number is a positive, decimal (base ten) integer   n   such that   d × nd   has at least   d   consecutive digits   d   where For instance, 753 is a super-3 number because 3 × 7533 = 1280873331.

Super-d   numbers are also shown on   MathWorld™   as   super-d   or   super-d.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Super-d numbers step by step in the 11l programming language

Source code in the 11l programming language

V rd = [‘22’, ‘333’, ‘4444’, ‘55555’, ‘666666’, ‘7777777’, ‘88888888’, ‘999999999’]

L(ii) 2..7
   print(‘First 10 super-#. numbers:’.format(ii))
   V count = 0

   BigInt j = 3
   L
      V k = ii * j^ii
      I rd[ii - 2] C String(k)
         count++
         print(j, end' ‘ ’)
         I count == 10
            print("\n")
            L.break
      j++

You may also check:How to resolve the algorithm Cumulative standard deviation step by step in the MiniScript programming language
You may also check:How to resolve the algorithm Animation step by step in the PicoLisp programming language
You may also check:How to resolve the algorithm Exponentiation order step by step in the Wren programming language
You may also check:How to resolve the algorithm Integer comparison step by step in the Elena programming language
You may also check:How to resolve the algorithm Largest int from concatenated ints step by step in the zkl programming language