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 |
This tag is used if a reference is needed in a paper or textbook on a specific result.
6
votes
Values of Dirichlet L-funcions at natural numbers
Also, there seem to be really interesting connections between the values of $\zeta_K(s)$ at positive integers and "higher regulators" of Bloch groups. For example, see this interesting paper:
H. Gang …
5
votes
2
answers
1k
views
A generalized Möbius function?
There are a number of generalizations of the Möbius function out there, which can be found by Google. But I'd just like to know if anything has been said about this:
For $k \geq 2$, $k \in \mathbb{Z} …
1
vote
Proof of infinitude of primes whose reversal in base 10 is also prime
Now, thinking about this a bit, let's say $f$ is the function that reverses the digits, so that $f(n)$ is the number that has the digits of $n$ in base 10 reversed. I think that when estimating $$|\{n …
0
votes
Proof of infinitude of primes whose reversal in base 10 is also prime
Hello all,
I must be overlooking something, but I wonder if the systems $\Psi:\mathbb{Z}^d\rightarrow \mathbb{Z}^t$ in the Green-Tao paper "Linear Equations in Primes" could apply to this question.
3
votes
Primes and Ackermann's function
Hartley (http://primes.utm.edu/curios/page.php/71.html) gives that 13 and 71 divide $A(m,n)$ for sufficiently large $m$.
Since $\{A(m+1,n): n \geq N\} \subset \{A(m,n): n\geq A(m+1,N-1)\}$, we need o …
4
votes
1
answer
920
views
Primes and Ackermann's function
If $A(m,n)$ is Ackermann's function, and $c$ is a fixed integer, are there any heuristics/conjectures/obvious things that can be said about primes of the form $A(m,n)+c$, $m \geq 4$,at all?
EDIT:
I …