(Ben ... yarım benim şimdiki yaşındayken) Lisenin sıkılmış olsa da, bunu buldum f ( x =) x ^{( x -1 )} kapsamaktadır, örneğin, bazı ilginç özelliklere sahip olduğunu azami f 0 ≤ için x isimli f ( e ) ve bir izotopun nükleonu başına bağlanma enerjisinin 6 x f ( x ÷ 21) ...

Yine de, dilinizin etki alanındaki herhangi bir sayı için x'in x'in kök ^dizinini hesaplayan en kısa işlevi veya programı yazın.

Örnek vakalar

Tüm diller için

     -1   >       -1
   ¯0.2   >    -3125
   ¯0.5   >        4
    0.5   >     0.25
      1   >        1
      2   >    1.414
      e   >    1.444 
      3   >    1.442
    100   >    1.047
  10000   >    1.001

Karmaşık sayıları işleyen diller için

   -2   >        -0.7071i
    i   >            4.81         
   2i   >    2.063-0.745i
 1+2i   >   1.820-0.1834i
 2+2i   >   1.575-0.1003i

Sonsuzlukla uğraşan diller için

-1/∞   >   0    (or ∞ or ̃∞)
   0   >   0    (or 1 or ∞)
 1/∞   >   0
   ∞   >   1
  -∞   >   1

Hem sonsuzlukları hem de karmaşık sayıları işleyen diller için

 -∞-2i   >   1      (or ̃∞)

^{̃∞yönlendirilmiş sonsuzluğu gösterir .}

TI-BASIC, 3 bayt

Ans×√Ans

TI-TEMEL nedenle, belirteçleri kullanarak Ansve ×√her ikisi de tek bir bayt vardır.

açıklama

Ansgirdi vermenin en kolay yoludur; Bu son ifadenin sonucudur. ×√bu, x'in x. kökü için bir fonksiyondur, örneğin 5×√322'dir.

Jöle, 2 bayt

*İ

Çevrimiçi deneyin!

Nasıl çalışır

*İ    Main link. Input: n

 İ    Inverse; yield 1÷n.
*     Power (fork); compute n ** (1÷n).

Javascript (ES2016), 11 bayt

x=>x**(1/x)

ES6'yı ES6'da nadiren kullanıyorum.

Python 3, 17 bayt

lambda x:x**(1/x)

Kendini açıklayan

Haskell, 12 11 bayt

Biraz sihir yaptığınız için teşekkürler @LambdaFairy:

(**)<*>(1/) 

Eski sürümüm:

\x->x**(1/x)

J, 2 bayt

^%

Çevrimiçi deneyin! .

Nasıl çalışır

^%  Monadic verb. Argument: y

 %  Inverse; yield 1÷y.
^   Power (hook); compute y ** (1÷y).

Pyth, 3 bayt

@QQ

Önemsiz zorluk, önemsiz çözüm ...

(rekabetçi olmayan, 1 bayt)

@

Bu, bu mücadeleyi yayınlayan Pyth sürümünde bulunan örtük giriş özelliğini kullanır.

JavaScript ES6, 18 bayt

n=>Math.pow(n,1/n)

Java 8, 18 bytes

n->Math.pow(n,1/n)

Java isn't in last place?!?!

Test with the following:

import java.lang.Math;

public class Main {
  public static void main (String[] args) {
    Test test = n->Math.pow(n,1/n);
    System.out.println(test.xthRoot(6.0));
  }
}

interface Test {
  double xthRoot(double x);
}

Java, 41 bytes

float f(float n){return Math.pow(n,1/n);}

Not exactly competitive because Java, but why not?

MATL, 5 bytes

t-1^^

Try it online!

t       % implicit input x, duplicate
 -1     % push -1
   ^    % power (raise x to -1): gives 1/x
    ^   % power (raise x to 1/x). Implicit display

Mathematica, 8 7 4 7 bytes

#^#^-1&

More builtin-only answers, and now even shorter! Nope. By definition, the next answer should be 13 bytes. (Fibonacci!) The pattern is still broken. :(

Perl 5, 10 bytes

9 bytes plus 1 for -p

$_**=1/$_

R, 19 17 bytes

function(x)x^x^-1

-2 bytes thanks to @Flounderer

Ruby, 15 Bytes

a=->n{n**n**-1}

Ungolfed:

-> is the stabby lambda operator where a=->n is equivalent to a = lambda {|n|}

NARS APL, 2 bytes

√⍨

NARS supports the √ function, which gives the ⍺-th root of ⍵. Applying commute (⍨) gives a function that, when used monadically, applies its argument to both sides of the given function. Therefore √⍨ x ↔ x √ x.

Other APLs, 3 bytes

⊢*÷

This is a function train, i.e. (F G H) x ↔ (F x) G H x. Monadic ⊢ is identity, dyadic * is power, and monadic ÷ is inverse. Therefore, ⊢*÷ is x raised to 1/x.

Python 2 - 56 bytes

The first actual answer, if I'm correct. Uses Newton's method.

n=x=input();exec"x-=(x**n-n)/(1.*n*x**-~n);"*999;print x

CJam, 6 bytes

rd_W##

Try it online!

How it works

rd     e# Read a double D from STDIN and push it on the stack.
  _    e# Push a copy of D.
   W   e# Push -1.
    #  e# Compute D ** -1.
     # e# Compute D ** (D ** -1).

Seriously, 5 bytes

,;ì@^

Try it online!

Explanation:

,;ì@^
,;     input, dupe
  ì@   1/x, swap
    ^  pow

Pylons, 5 bytes.

ideAe

How it works.

i # Get command line input.
d # Duplicate the top of the stack.
e # Raise the top of the stack to the power of the  second to the top element of the stack.
A # Push -1 to the stack (pre initialized variable).
e # Raise the top of the stack to the power of the second to the top element of the stack.
  # Implicitly print the stack.

Japt, 3 bytes

UqU

Test it online!

Very simple: U is the input integer, and q is the root function on numbers.

C++, 48 bytes

#include<math.h>
[](auto x){return pow(x,1./x);}

The second line defines an anonymous lambda function. It can be used by assigning it to a function pointer and calling it, or just calling it directly.

Try it online

Milky Way 1.6.5, 5 bytes

'1'/h

Explanation

'      ` Push input
 1     ` Push the integer literal
  '    ` Push input
   /   ` Divide the STOS by the TOS
    h  ` Push the STOS to the power of the TOS

x**(1/x)

Usage

$ ./mw <path-to-code> -i <input-integer>

O, 6 bytes

j.1\/^

No online link because the online IDE doesn't work (specifically, exponentiation is broken)

Explanation:

j.1\/^
j.      push two copies of input
  1\/   push 1/input (always float division)
     ^  push pow(input, 1/input)

𝔼𝕊𝕄𝕚𝕟, 5 chars / 7 bytes

Мű⁽ïï

Try it here (Firefox only).

Trivial.

Pyke (commit 29), 6 bytes

D1_R^^

Explanation:

D      - duplicate top
 1_    - load -1
   R   - rotate
    ^  - ^**^
     ^ - ^**^

C# - 18 43 41 bytes

float a(float x){return Math.Pow(x,1/x);}

-2 byes thanks to @VoteToClose

Try it out

Note:

First actual attempt at golfing - I know I could do this better.

C, 23 bytes

#define p(a)pow(a,1./a)

This defines a macro function p which evaluates to the ath root of a.

Thanks to Dennis for reminding me that gcc doesn't require math.h to be included.

Thanks to @EʀɪᴋᴛʜᴇGᴏʟғᴇʀ for reminding me that the space after the first ) is not needed.

Try it online

dc, 125 bytes

15k?ddsk1-A 5^*sw1sn0[A 5^ln+_1^+ln1+dsnlw!<y]syr1<y1lk/*sz[si1[li*li1-dsi0<p]spli0<p]so0dsw[lzlw^lwlox/+lw1+dswA 2^!<b]dsbxp

Unlike the other dc answer, this works for all real x greater than or equal to 1 (1 ≤ x). Accurate to 4-5 places after the decimal.

I would have included a TIO link here, but for some reason this throws a segmentation fault with the version there (dc 1.3) whereas it does not with my local version (dc 1.3.95).

Explanation

As dc does not support raising numbers to non-integer exponents to calculate x^(1/x), this takes advantage of the fact that:

So, to calculate ln(x), this also takes advantage of the fact that:

whose definite integral from 1 to (b = x) is numerically-approximated in increments of 10^-5 using the following summation formula:

.

The resulting sum is then multiplied by 1/x to get ln(x)/x. e^(ln(x)/x) is then finally calculated using the e^x Maclaurin Series to 100 terms as follows:

.

This results in our relatively accurate output of x^(1/x).

PHP 5.6, 32 30 29 bytes

function($x){echo$x**(1/$x);}

or

function($x){echo$x**$x**-1;}

_{30->29, thank you Dennis!}