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 |
Computational Number Theory is for explicit calculations or algorithms involving anything of interest to number theorists.
90
votes
Accepted
How to calculate [10^10^10^10^10^-10^10]?
I think the number in question is $10^{10^{10}}+10^{11}\ln^4(10)$ plus a tiny positive number. That is, it starts with a digit $1$, followed by $10^{10}-13$ zeros, then by the string $2811012357389$, …
19
votes
Accepted
Can every integer be written as a sum of squares of primes?
The answer is yes, and this follows from known results concerning the Waring-Goldbach problem.
16
votes
Accepted
simple conjecture on palindromes in base 10
Using
$$\frac{10^c-1}{9}=\sum_{m=0}^{c-1} 10^m,$$
the product in question equals
$$\sum_{n=0}^{2a+2b+c-1}r(n)10^n,$$
where $r(n)$ is the number of times $n$ occurs among the numbers (counted with mult …
6
votes
Numerically double-checking formula with L-values
This is a good question around an important issue. The first thing that came to my mind is Popa's article "Central values of Rankin $L$-series over real quadratic fields", which is about a related pro …
6
votes
Accepted
Is the nth-power-sum graph connected?
Yes, the graph $\mathcal{G}_n$ is connected, and its diameter is at most $n2^n$. To see this, write $s$ for $n2^{n-1}$, and fix any two vertices $a,b\in\mathbb{N}^*$. By Wright's solution of Waring's …
5
votes
Why is integer factoring hard while determining whether an integer is prime easy?
It is like cooking. A recipe can be easy to follow, but figuring it out from the resulting meal can be hard (cf. secret recipe).
5
votes
Accepted
Generators of the ideal class group
Let $G$ be the ideal class group, and let $H$ be the subgroup generated by the prime ideals of norm at most $3\log^2(d^2)=12\log^2(d)$. Assume that $H$ is a proper subgroup of $G$. Then there is a non …
4
votes
Counting powerful integers. Lower bounds
Golomb (1970) proved that for all $x\geq 1$ we have
$$\frac{\zeta(3/2)}{\zeta(3)}x^{1/2}-3x^{1/3}\ \leq\ \left|\mathrm{POW}(x)\right|\ \leq\ \frac{\zeta(3/2)}{\zeta(3)}x^{1/2}.$$
Note that
$$\frac{\ze …