fork(2) download
copy 
  1. N = 10; % input
  2. t = .0001:.0001:2; % range of possible values: [.0001 .0002 ... 2]
  3. r = t;
  4. for k = 2:N
  5.     r = t.^r; % repeated exponentiation, element-wise
  6. end
  7. [~, ind] = min(abs(r-N)); % index of entry of r that is closest to N
  8. result = t(ind);
  9. disp(result)
Success #stdin #stdout 0.23s 103552KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
 1.5085
https://ideone.com/6yuUaZ
language:
Octave (octave 4.4.1)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!