Write code that outputs the smallest integer \$n > 5\$ such that \$\frac{\sqrt{\log_2{n}}}{(\log_2 {\log_2 n})^2} > 1\$. Your code may have at most one digit in its source code. You can use your chosen digit more than once however.
By digits we are only counting the ASCII characters between 0x30 and 0x39 (inclusive).
print(-~2**2**2**2**2)
According to WolframAlpha, the equation \$\sqrt{\log_2(x)} = \log_2(\log_2(x))^2\$ has three solutions. Two real numbers around 1 and 5 and a very large integer solution. So what is that large integer solution?
Simple transformations on both sides yield $$ \log_2(x)^{\frac 1 4} = \log_2(\log_2(x)) \\ 2^{2^{log2(x)^{1/4}}} = x $$ Now, substitute \$y=\log_2(x)^{1/4}\$. Note that \$y\$ has to be an integer as well. This yields two equations: $$ 2^{2^y} = x, \quad y=\log_2(x)^{\frac 1 4} \\ 2^{2^y} = x, \quad y^4=\log_2(x) \\ 2^{2^y} = x, \quad 2^{y^4}=x \\ 2^{2^y} = 2^{y^4} \\ 2^y = y^4 \\ $$
The only integer solution to this is \$y=16\$, leaving us with \$x=2^{16^4}=2^{2^{2^{2^2}}}\$. The first integer that satisfies the inequality is \$x+1\$.
gmp::as.bigz(2)^2^2^2^2+T
Port of @ovs’ Python answer, so be sure to upvote that one too! R has no native bigint support so this needs the gmp package.
k₴E›
Bitstring:
10000100001000010110011010000
Port of the python answer, but without any digits at all.
k₴E›
k₴E # 2 ** 65536
› # + 1
💎
Created with the help of Luminespire.
-1 thanks to @l4m2
The only (decimal) digit used in the source is 0.
_=>-~(-~0n>>~0xFFFFn)
This computes \$1+2^{1+65535}\$
With all the BigInt suffixes and extra parentheses due to a different operator precedence, a direct port of ovs' answer would be 25 bytes:
_=>-~(2n**2n**2n**2n**2n)
12 bytes version, provided by @att
+++2^2^2^2^2
13 bytes version. Try it online!
2^2^2^2^2+2/2
Ｉ⊕Ｘ²Ｘ⁴¦⁸
Try it online! Link is to verbose version of code. Explanation:
² Literal integer `2`
Ｘ Raised to power
⁴ Literal integer `4`
Ｘ Raised to power
⁸ Literal integer `8`
⊕ Incremented
Ｉ Cast to string
Implicitly print
10 bytes using only one superscript digit:
Ｉ⊕Ｘ²Ｘ⊗²⊗⊗²
Try it online! Link is to verbose version of code. Explanation: As above, but uses Doubled (⊗) to make 4 and 8 from 2. (A port of @ovs' Python solution would have been 12 bytes.)
⁹²2*‘
Port of @ovs’ Python answer, so be sure to upvote that one too! The superscript digits are permitted as per reply to comment from @Simd (the OP).
⁹ | 256
² | Squared
2* | 2 to the power of this
‘ | +1
The trailing new line is required
I'm using a screenshot as the non ascii character gets removed on save
Explanation:
2 Pushes 2 on the stack
'0xFFFF Pushes 65535 on the stack
h Increment the top of the stack
E Pop y, pop x, push x^y
h Increment the top of the stack
/ O @ Output and exit
Same byte count using Ā for \$256 * 256 = 65536\$
2'Ā.*Eh/ O @
0xFFFF in the explanation, I just use it as a placeholder to show the value of the unprintable character, otherwise the other O stands for Output
\$\endgroup\$
𐀀 work instead of h? (Same byte count though.)
\$\endgroup\$
𐀀 would not work, I do not think it is a valid Alice instruction. h increments the result by 1 as the desired output is the result of \$2^{65536}+1\$
\$\endgroup\$
₁no>
Without using the superscript number(s) either, it's still 4 bytes:
žHo>
Explanation:
₁ # Push builtin 256
n # Square it to 65536
žH # (or alternatively) Push builtin 65536
o # Pop and push 2 to the power this 65536
> # Increase it by 1
# (which is output implicitly as result)
>:^^:*~2x
>:^^:*~2x
2x bigint 2
^^:*~ call ^^:* with 2x on both sides:
^: repeat
^ 2^ (2 is the left argument of ^:)
* 2*2 times (the 2s are the left and right arguments of ^:)
the result so far = 2^(2^(2^(2^(2))))
>: increment
Bonus 10 and 11 bytes:
>:2x^*:#a.
a. a built-in string containing 256 extended ascii chars
# length of it (256)
*: square
2x^ raise 2 to the power of that
>: increment
>:^/2>.i:2x
i:2x -2 -1 0 1 2
2>. apply max(2, x) to each element; 2 2 2 2 2
^/ reduce by ^ from the right; 2^(2^(2^(2^(2))))
>: increment
Explanation:
1+0xFFFF[!1] # Calculates 65536
[bigint]::pow(1+1, ) # Calculates 2^65536
+1 # Increments by 1 and implicitly prints on stdout
⁹²2*‘a valid Jelly solution? \$\endgroup\$ackermann(4, 2) + 4. \$\endgroup\$