Skip to main content
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
Search options not deleted user 3199

Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions

3 votes
Accepted

Bounded gaps between powers

According to the Wikipedia page on Catalan's conjecture, the problem you pose is open. (Look under the "generalization" heading.) A more general problem is Pillai's conjecture.
Pace Nielsen's user avatar
  • 19.9k
5 votes

On the prime $k$-tuple problem

It is currently believed that the second conjecture is likely false, but it hasn't been proven quite yet. There is an interval of size 3159 which is not prevented from having more primes than the ini …
Pace Nielsen's user avatar
  • 19.9k
6 votes
1 answer
357 views

A modification of the Ljunggren-Nagell equation

[Thanks to Gerhard Paseman for helping me reformulate my original question.] The equation $$ \frac{a^m-1}{a-1}=b^2 $$ was solved by Ljunggren, building on work of Nagell, who showed that if $a>1$, $b …
Pace Nielsen's user avatar
  • 19.9k
3 votes
Accepted

Estimate for the $2n$-th consecutive prime number

Let's use some standard bounds on the $n$th prime, as found in this paper by Pierre Dusart. We have $$ p_{2n} \leq 2n[\ln(2n)+\ln(\ln(2n))-0.9484] = 2n\left[\ln(n)+\ln\left(\frac{2}{e^{0.9484}}\ln(2n) …
Pace Nielsen's user avatar
  • 19.9k
2 votes

Best known bounds for a product over primes in an interval

The best source for explicit, unconditional bounds on such products that I'm aware of is in the work of Pierre Dusart. See his paper Explicit estimates of some functions over primes. In Section 5.4, …
Pace Nielsen's user avatar
  • 19.9k
3 votes

Character sums over prime arguments

An update on this problem: I found out how to compute effective (and asymptotically accurate) bounds for $\sum_{p\leq x,\, p\equiv a\pmod{k}}\log(p)/p$. Basically it boils down to the usual analytic …
Pace Nielsen's user avatar
  • 19.9k
3 votes

Factorizing polynomials in $\mathbf{Z}[[x]]$

Edited due to mistakes pointed out in the comments: I think the answer to the problem might be yes. Here are some preliminary thoughts. First, you know $f_{\nu}(x)$ divides $f(x)$, since $f(x)$ is …
Pace Nielsen's user avatar
  • 19.9k
10 votes

How do we recognize an integer inside the rationals?

I just ran across the following paper: Defining Z in Q It uses another characterization of the integers inside the rationals that none of us listed, perhaps because it is so trivial. Namely, the int …
Pace Nielsen's user avatar
  • 19.9k
42 votes
Accepted

Iterated logarithms in analytic number theory

There are two main sources of repeated logs. (These sources can be further refined into natural subcategories, but I'll only mention a couple of those subcategories.) Those two main sources are: Typ …
Pace Nielsen's user avatar
  • 19.9k
25 votes
Accepted

How to quickly determine whether a given natural number is a power of another natural number?

This can be done in "essentially linear time." Check out Daniel Bernstein's website: http://cr.yp.to/arith.html Especially note his papers labeled [powers] and [powers2].
Pace Nielsen's user avatar
  • 19.9k
32 votes
6 answers
5k views

How do we recognize an integer inside the rationals?

My question is fairly simple, and may at first glance seem a bit silly, but stick with me. If we are given the rationals, and we pick an element, how do we recognize whether or not what we picked is …
Pace Nielsen's user avatar
  • 19.9k
12 votes
Accepted

Consecutive numbers with mutually distinct exponents in their canonical prime factorization

The answer to this question is almost certainly no. It is well known that the ABC Conjecture implies that there are only finitely many triples $(n,n+1,n+2)$ which are all powerful. A similar argumen …
Pace Nielsen's user avatar
  • 19.9k
8 votes
Accepted

Ruling out an extremely specific class of Wieferich-like primes

This is impossible from standard results about cyclotomic polynomials and their factors. Note that $\frac{q^{p-1}-1}{p-1}$ is just $$ \prod_{d|(p-1), d>1}\Phi_d(q), $$ where $\Phi_d(x)$ is the $d$th …
Pace Nielsen's user avatar
  • 19.9k
4 votes
1 answer
698 views

Correct growth rate of logarithmic derivative of zeta, outside critical strip

Let $\zeta$ be the Riemann zeta-function, and let $t> 0$. I'm interested in the growth rate of $$ \left|\frac{\zeta'}{\zeta}\left(-\frac{1}{2}+it\right)\right| $$ as $t\to\infty$. It is easy to find …
Pace Nielsen's user avatar
  • 19.9k
14 votes
1 answer
2k views

Character sums over prime arguments

Let $f$ be a monotone decreasing, continuously differentiable function with $\lim_{x\rightarrow \infty}f(x)=0$. Let $\chi$ be a non-principal Dirichlet character. It is standard to show that $\sum_{ …
Pace Nielsen's user avatar
  • 19.9k

15 30 50 per page