Answer by emanresu A for Minimal Power Root
Vyxal, 6 bytesλfge;ẊTry it Online!λ ;Ẋ # While result changes... f # Convert to digitlist g # Take minimum e # Number to power of that
View ArticleAnswer by David G. for Minimal Power Root
Dash (or other generic Bourne shell) +bc, 190 bytesa=0while :doa=`echo $a+1|bc`b=$awhile :dofor m in `seq 0 9`docase "$b" in*$m*)break;;esacdonecase $m in0)break;;1)[ $a = $b ]||echo...
View ArticleAnswer by DeathIncarnate for Minimal Power Root
Burlesque, 35 bytesr0f{J{J<]**}{J<]1!=}w!J1!=x/x/!=&&}Try it online!"Produces" the infinite list of MPRs (i.e. never finishes, never prints). For a finite list use:Burlesque, 36...
View ArticleAnswer by S.S. Anne for Minimal Power Root
C (gcc), 171153 138 bytes__int128 m,a,t,h,s;r(){for(a=10,h=s;a=fmin(h%10,a),h/=10;);a=pow(s,a);a-s&&r(s=a);}f(n){for(;t-n;a-1&&a-m&&printf("%lu ",m,t++))r(s=++m);}Outputs the...
View ArticleAnswer by mabel for Minimal Power Root
Python 3, 54 byteslambda n,x=0:n!=x and f(n**min(map(int,str(n))),n)or nTry it online!
View ArticleAnswer by user36046 for Minimal Power Root
C (clang)+-DL=long long-lm, 213 bytesq(char*a,char*b){return*a>*b;}L f(L a){char*c;asprintf(&c,"%lld",a);qsort(c,strlen(c),1,q);L b=pow(a,*c-48);return b>a?f(b):b;}i;g(j){for(i=0;j;i++){L...
View ArticleAnswer by user48543 for Minimal Power Root
Husk, 1612 10 bytesfS>ωṠ^o▼dNSaved 6 bytes thanks to H.PWiz.Try it online!ExplanationfS>ωṠ^o▼dNf N Filter the natural numbers where...ω ... the fixed point...Ṡ^o▼d ... of raising the number to...
View ArticleAnswer by Kamil Drakari for Minimal Power Root
Japt, 44 bytes_ìñ g_gV ¥1?Z:ZpZgV)gW@@[1X]øXgW}fXÄ}gUÄTry it online!Substantially different from the other Japt answer.Explanation: Empty line preserves the input_ìñ g Function V finds the smallest...
View ArticleAnswer by Arnauld for Minimal Power Root
JavaScript (Node.js), 75 bytesReturns the \$n\$th term, 1-indexed.f=(i,x=n=1n)=>(N=x**BigInt(Math.min(...x+'')))>x?f(i,N):(i-=N>n)?f(i,++n):nTry it online!
View ArticleAnswer by JosiahRyanW for Minimal Power Root
Python 3, 102 bytesx=int(input())a=c=0while x: a+=1;b=a while b-c:b,c=b**int(min(str(b))),b x-=b!=1and b!=aprint(a)Try it online!Decided to try a Python 3 solution that directly prints the nth term in...
View ArticleAnswer by user58988 for Minimal Power Root
APL(NARS), 96 chars, 192 bytesr←f w;k;i;a r←⍬⋄k←1A: i←kB: →C×⍳i=a←i*⌊/⍎¨⍕i⋄i←a⋄→BC: →D×⍳(a=k)∨a=1⋄r←r,kD: k+←1⋄→A×⍳k≤wtest (partial result for argument 22 seems to much big so <21 arguments I don't...
View ArticleAnswer by JRowan for Minimal Power Root
Common Lisp, 238 bytes(defun x(m n o p q)(setf i(sort(map 'list #'digit-char-p(prin1-to-string m))#'<))(setf j(expt m(first i)))(cond((= q p)nil)((and(= n j)(not(= n 1))(not(= n o)))(cons o(x(1+...
View ArticleAnswer by Brian J for Minimal Power Root
Visual Basic .NET (.NET Core), 290 bytes (includes imports)Iterator Function A()As System.Collections.IEnumerableDim i=B.One,q=i,p=iWhile 1=1q=i-1p=iWhile q<>pFor j=0To 9If...
View ArticleAnswer by user58988 for Minimal Power Root
Axiom, 168 bytesu(x)==(y:=x::String;x^reduce(min,[ord(y.i)-48 for i in 1..#y])::NNI)q(a:PI):PI==(b:=a;repeat(c:=u(b);c=b=>break;b:=c);b)z(x)==[i for i in 1..x|(m:=q(i))~=1 and m~=i]The function to...
View ArticleAnswer by nimi for Minimal Power Root
Haskell, 67 62 bytesfilter((<)<*>until((==)=<<g)g)[1..]g a=a^read[minimum$show a]Returns an infinite list.Try it online!
View ArticleAnswer by Galen Ivanov for Minimal Power Root
Racket, 270, 257 233 bytes(define(f n)(local((define(m x)(expt x(-(first(sort(map char->integer(string->list(~v x)))<))48)))(define(g y)(if(= y(m y))y(g(m y))))(define(k x l)(if(=(length...
View ArticleAnswer by Emigna for Minimal Power Root
05AB1E, 8 bytesGenerates the nth number 1-indexedµNÐΔWm}‹Try it online!Explanationµ # run until counter equals input NÐ # push 3 copies of the current iteration index (1-based)Δ } # run this code until...
View ArticleAnswer by Kevin Cruijssen for Minimal Power Root
Java 10, 178 173 bytesv->{for(int x=1,m;;){var b=new...
View ArticleAnswer by G B for Minimal Power Root
Ruby, 52 bytesx=1;loop{b=x+=1;1while b<b**=b.digits.min;b>x&&p(x)}Try it online!Prints infinite sequence
View ArticleAnswer by Bubbler for Minimal Power Root
JavaScript (Chrome), 78 77 bytesF=x=>(m=x**BigInt(Math.min(...''+x)))>x?F(m):mfor(x=0n;++x;)x<F(x)&&alert(x)Try it online!Port of my own Python 3 solution. The latest version of Chrome...
View Article
