Super-d numbers

From Fōrmulæ wiki
Jump to: navigation, search

This page is a solution to the task Super-d numbers in the Rosetta Code, written in Fōrmulæ.

Description (from Rosetta Code)

A super-d number is a positive integer n such that d × n^d has at least d consecutive digits d where
   2 ≤ d ≤ 9

For instance, 753 is a super-3 number because 3 × 753^3 = 1280873331.

  • Write a function/procedure/routine to find super-d numbers.
  • For d=2 through d=6, use the routine to show the first 10 super-d numbers.
Extra credit
  • Show the first 10 super-7, super-8, and/or super-9 numbers.   (Optional)
See also


The following function creates a list of the first n super-d numbers:


To show the list of the first 10 super-2 numbers:


To show the lists for super-2 to super-9 (first 10 numbers):