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 18494

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

7 votes

Small residue classes with small reciprocal

Professor Tao, I do not know whether this answer is in the least useful but will post it anyway! I'm not sure but perhaps one approach is via Linnik's theorem that the least prime, say, $p(r,q)$ in …
Timothy Foo's user avatar
  • 1,075
0 votes

A question regarding simultaneous congruences

That's a very interesting problem. If one restricts to initial point $(x,1)$, its like a generalization of the question of points $(x,y) \in (\mathbb{F}_p)^2$ so that $xy\equiv 1 \bmod p$ with $(x,y)$ …
Timothy Foo's user avatar
  • 1,075
1 vote
0 answers
58 views

A question about the relative size of bases to which numbers represented by polynomials are ...

In Theorem 2 of their paper, "Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function", Indagationes Mathematicae, Volume 17, Issue 4, pp. 611--625, Luca and Shparlinski show …
Timothy Foo's user avatar
  • 1,075
7 votes
0 answers
342 views

Which integer polynomials represent fewer primes, in terms of order of magnitude, when shift...

Let $f(x_1,\dots,x_n) \in \mathbb{Z}[x_1,\dots,x_n]$ be a polynomial for which the set of integers not represented by it is infinite. I'm curious about cases in which there exists an integer $c$ such …
Timothy Foo's user avatar
  • 1,075
2 votes
2 answers
913 views

Analogues of Jacobsthal's function

EDIT: Gerhard Paseman has given some wonderful answers to this question below. Thank you. This is an attempt to revisit this to hopefully make the question more rigorous with some notation and try to …
Timothy Foo's user avatar
  • 1,075
9 votes

Monic polynomial with integer coefficients with roots on unit circle, not roots of unity?

For a class of concrete examples with at least asymptotically more than $n/2$ zeros on the unit circle, the Fekete polynomials, which were just mentioned recently by Franz Lemmermeyer at this question …
Timothy Foo's user avatar
  • 1,075
3 votes

Infinitely many primes of the form $2^n+c$ as $n$ varies?

Hi there, I hope I'm not duplicating anything with what I will write. Here goes: If one considers the Bateman-Horn conjecture, it predicts that $$ \sum_{n \leq x}\Lambda(f(n)) \sim \prod_p\left(\frac{ …
Timothy Foo's user avatar
  • 1,075
4 votes
0 answers
327 views

Shortest interval over which there are more quadratic residues than nonresidues

Hi, I refer to formula (8) in Chapter 1 of H. Davenport, Multiplicative Number Theory, Third Edition, Springer (2000), which says that for primes $q\equiv 3 \bmod 4$: $$ L\left(\left(\frac{\cdot}{q}\ …
Timothy Foo's user avatar
  • 1,075
3 votes
Accepted

Can the relative count of the primefactors in $\small \lim_{w\to\infty}\prod_{k=1}^w (p_k-1)...

Mr Helms, This is the $n=1$ case. Your formula gives $e_{1,q}=q$. Say we want to study how often prime $q=q_k$ divides $\prod_{p \leq x}(p-1)$. Maybe write this product as $$ \left(\prod_{i=1}^m\prod …
Timothy Foo's user avatar
  • 1,075
2 votes

Generalizing Euclid's proof of the infinity of primes

Not claiming to be a real number theorist or anything of that sort...Just wondering, is one possible approach to Mark Sapir's strong conjecture (assuming an answer isn't already known) to calculate $$ …
Timothy Foo's user avatar
  • 1,075
11 votes

Every prime number > 19 divides one plus the product of two smaller primes?

Perhaps this might be another perspective on this problem. In an answer to a question I had previously asked on Math Overflow, "A generalized Möbius function?", the following paper of Addison was cite …
Timothy Foo's user avatar
  • 1,075
5 votes

Using Vinogradov's theorem for finding prime solutions to a linear equation (an exercise fro...

Hello, I too would be very curious about this bound and will think further about this. The nice thing about the $u_i(y)$, as I recall my advisor having told me, is that the estimates for geometric su …
9 votes
1 answer
524 views

Infimums of exponential sums involving primes

Hi, I don't know if this question is appropriate for Math Overflow but I was wondering if there is anything known about the following: Let $$ S(\alpha) = \sum_{n \leq x}\Lambda(n)e(n\alpha). $$ Then …
Timothy Foo's user avatar
  • 1,075
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} …
Timothy Foo's user avatar
  • 1,075
4 votes

Irreducibility of polynomials related to quadratic residues

Hi, In Remark 2 of "Zeros of Fekete Polynomials", (http://arxiv.org/PS_cache/math/pdf/9906/9906214v1.pdf), Conrey et. al. give $$\sup_{|z|=1}|f(z)| \ll p^{0.5} \log p.$$ But the Mahler measure of $f …
Timothy Foo's user avatar
  • 1,075

15 30 50 per page