Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computational-number-theory
Search options questions only
not deleted
user 527311
Computational Number Theory is for explicit calculations or algorithms involving anything of interest to number theorists.
34
votes
0
answers
1k
views
Is $2\uparrow\uparrow\infty + 3$ divisible by a prime number?
Define power tower using Knuth's arrow: $$a\uparrow\uparrow b=\left.a^{a^{a^{...^a}}}\right\}b\text{ layers}$$
It can be proved that for any positive integers $a, n, m\ \ $,
$\lim_{n \to \infty} a \up …
- 631