Skip to main content

All Questions

37 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
26 votes
0 answers
567 views

Elliptic analogue of primes of the form $x^2 + 1$

I have a project in mind for an undergraduate to investigate next quarter -- a curiosity really, but I'm surprised I can't find it in the literature. I do not want a detailed analysis here... but ...
Marty's user avatar
  • 13.3k
17 votes
0 answers
891 views

An elementary proof that, for every fixed $n \in \mathbf N^+$, there are infinitely many primes $\equiv -1 \bmod n$

This morning, I made a comment to a comment to a question of Ayman Moussa, only to point out that, among many others, there is an elementary proof of Dirichlet's theorem on the existence of infinitely ...
Salvo Tringali's user avatar
9 votes
0 answers
414 views

In which orders can the numbers of prime factors of consecutive integers be?

Let $\omega(m)$ be the number of distinct prime divisors of a positive integer $m>1$. I am interested in the relative orders in which the numbers $\omega(n+1),...,\omega(n+k)$ can occur. Given a ...
Joni Teräväinen's user avatar
7 votes
0 answers
786 views

"Forthcoming paper" of Goldston-Graham-Pintz-Yıldırım

The above-named authors of [1] and its (significantly different) published version [2] write: In a forthcoming paper, we will show how the methods here can be extended to prove corresponding ...
Charles's user avatar
  • 9,114
6 votes
0 answers
149 views

Dickson's conjecture for Beatty sequences

A particular case of Dickson's Conjecture states that for $a_1,q_1,a_2,q_2$ with $(a_1,q_1)=(a_2,q_2)=1$, there are infinitely many $n$ for which $q_1 n + a_1$ and $q_2 n+a_2$ are both prime, provided ...
Joshua Stucky's user avatar
5 votes
0 answers
261 views

Primes generated by cyclotomic polynomials

Let $p$ be an odd prime, and let $f=\Phi_p$ be the $p$-th cyclotomic polynomial. Denote by $S_p$ the set of primes $q$ such that there exists a sequence of primes $p_1,\dots, p_g$ such that $p_1=f(1)=...
Maurizio Moreschi's user avatar
5 votes
0 answers
131 views

Taking integer values of a sequence of Beurling primes

Let $P=(p_j)_{j=1}^\infty$ be an increasing sequence of real numbers with $1<p_1$ and $\lim_{j\to\infty}p_j=\infty$. As mentioned in [1], Beurling proved that if the multiplicative group $N_P$ ...
Anon12345's user avatar
5 votes
0 answers
194 views

Asymptotic expansion for the average of $\omega(n)^2$

Let $\omega(n)$ be the prime factors counting function. I computed that for any $k\geq 0$, there exist certain constants $c_{-1},c_0,c_1,c_2,...c_k$ such that $$\sum_{n\leq x}\omega(n)^2=x(\log\log x)...
The Number Theorist's user avatar
5 votes
0 answers
425 views

Conjectured new primality test for Mersenne numbers

How to prove that this conjecture about a new primality test for Mersenne numbers is true ? Definition: Let $M_{q}=2^{q}-1 , S_{0} = 3^{2} + 1/3^{2} , \ and: \ S_{i+1} = S_{i}^{2}-2 \pmod{M_{q}}$ ...
Tony Reix's user avatar
  • 161
4 votes
0 answers
335 views

The number of continuously increasing primes gaps in the interval $[2,n]$ is less than $\log n$

A prime gap is the difference between two successive prime numbers. The $n$-th prime gap, denoted $g_n$ or $g(p_n)$ is the difference between the $(n+1)$-st and the $n$-th prime numbers. Using my ...
Đào Thanh Oai's user avatar
4 votes
0 answers
273 views

Kaczorowski's Paper on Distribution of Primes

I am looking for a digital copy of the following paper by Jerzy Kaczorowski: ON THE DISTRIBUTION OF PRIMES (mod4) https://www.degruyter.com/view/j/anly.1995.15.issue-2/anly.1995.15.2.159/anly.1995.15....
primefinder's user avatar
4 votes
0 answers
176 views

Are there any results about this higher degree Titchmarsh divisor problem?

Does there exist an asymptotic formula for $\sum_{p\le x}\tau(p−1)^n$ ? Here $n$ is an arbitrary positive integer and $\tau$ is the divisor function. The case of $n=1$ was done by Linnik, but when $n$ ...
user97495's user avatar
4 votes
0 answers
117 views

Best constant for Maier's theorem?

Maier proved that, for fixed $\lambda>1,$ $$ \limsup_{x\to\infty}\frac{\pi(x+\log^\lambda x)-\pi(x)}{\log^{\lambda-1}x}>1 $$ and in particular $$ \limsup_{x\to\infty}\frac{\pi(x+\log^\lambda x)-\...
Charles's user avatar
  • 9,114
4 votes
0 answers
369 views

Reducing factoring prime products to factoring integer products (in average-case)

My question is about the equivalence of the security of various candidate one-way functions that can be constructed based on the hardness of factoring. (This question has been asked also in the CS ...
Omid Etesami's user avatar
3 votes
0 answers
158 views

What can be said about the primality of Zsigmondy numbers?

I am cross-posting this from math.stackexchange, as it has received upvotes but no comments/answers after a couple months. Let $\mathcal{Z}(n,a,b)=\frac{\Phi_n(a,b)}{\gcd (\Phi_n(a,b),n)}$ be the $n$-...
Tejas Rao's user avatar
  • 101
3 votes
0 answers
154 views

Reference request for the following results

I am looking for references on the following results. In what follows $\pi(x)$ denotes the prime counting function. Result 1. For all real $k>1$ there exists $x^k_0 \in \mathbb{R}$ such that for ...
S. Das's user avatar
  • 31
3 votes
0 answers
154 views

Is there a name for sequences of integers reduced to their lowest prime divisors?

When trying to obtain the value of Jacobsthal's function for some $n$; to find the largest sequence of consecutive numbers that are all coprime to $n$, one approach (and the only direct approach that ...
Brad Graham's user avatar
3 votes
0 answers
408 views

The second conjecture about the degrees of special polynomials

Define the congruence "modulo m" on exponential Taylor series following the previous post (A conjecture about the degrees of special polynomials) It has been conjectured, that if we define the ...
Danil Krotkov's user avatar
2 votes
0 answers
103 views

On equidistribution of primes in positive characteristic

In S. Lang's book "Algebraic Number Theory" (1986), page 317, Theorem 6 states essentially that given $P$ a set of primes, let $\tau:P\longrightarrow J$ be the typical idèle map taking ...
Hair80's user avatar
  • 675
2 votes
0 answers
313 views

On the Chowla and twin prime conjectures

I'm reading https://terrytao.wordpress.com/tag/chowlas-conjecture/ and at some point it is mentioned that, the twin prime conjecture is a variant of Chowla's conjecture that $\sum_{n\leq x} \lambda(n)\...
Q_p's user avatar
  • 1,019
2 votes
0 answers
160 views

Where can I find a copy of this paper of Chowla and Vijayaraghavan?

Does anyone know where I can find a copy of Chowla and Vijayaraghavan's paper, ''On the largest prime divisors of numbers''? The relevant literature say it was published in the Journal of the Indian ...
Q_p's user avatar
  • 1,019
2 votes
0 answers
76 views

Is there an estimate available for a sum of the form $\sum_{\mathbf{x} \equiv \mathbf{a} (H) } \mu^2(x_1 x_2)$

I am interested in a sum of the shape $$ \sum_{ \substack{ 1 \leq x_1, x_2 \leq B\\ \mathbf{x} \equiv \mathbf{a} (H) } } \mu^2(x_1 x_2). $$ I figured it must have been considered before, but I have ...
Johnny T.'s user avatar
  • 3,625
2 votes
0 answers
149 views

$f(x)$-th largest number of prime factors

Given a sufficiently well-behaved function $1\le f(x)\le x$ and a multiset $S=\{\omega(n): 1\le n\le x\}$, what can be said about the asymptotics of the $f(x)$-th largest member of $S$? In other words,...
Charles's user avatar
  • 9,114
2 votes
0 answers
236 views

On the cardinality of the set of right-truncatable primes

We say that the (base ten) prime number $p=a_{n}a_{n-1}a_{n-2}\cdots a_{1}a_{0}$ is right-truncatable if all of the following numbers are prime: \begin{eqnarray*}a_{n},\\a_{n}a_{n-1},\\ a_{n}a_{n-1}...
José Hdz. Stgo.'s user avatar
2 votes
0 answers
207 views

n-ary quadratic forms with $S$-integer values

Let $Q(x_1,\ldots,x_n):=x_1^2+\cdots+x_n^2$ be an $n$-ary quadratic form. Given a finite set of (rational) primes $S$ is there an algorithm or theorem that describes all solutions to $Q(x_1,\ldots,...
Eric Rowell's user avatar
  • 1,639
1 vote
0 answers
132 views

Are the binary digits of the sequence of the prime numbers correlated?

Let $p_n\geq 3$ be the $n$th prime number with the binary expansion $p_n = \sum_{k=0}^{\infty} b_{nk}2^k$ ($b_{nk}\in\{0,1\}$). Let's write $q_{nk} = 1-2b_{nk}$. Question: Is it true that for $k,l\...
Onur Oktay's user avatar
  • 2,605
1 vote
0 answers
98 views

Reference request for a result in additive combinatorics

Let $p$ be a prime number and $[p-1]=\{1, 2, \ldots, p-1\}$. The following proposition is proved: (but I cannot find out where) Proposition: The non-empty subset sums of $[p-1]$ are equally ...
Konstantinos Gaitanas's user avatar
1 vote
0 answers
139 views

Alternative Mersenne numbers

Let $\ b\in\mathbb Z,\ $ and $\ |b|>1.\ $ Call $$ M_b(n)\ :=\ \frac{b^n-1}{b-1} $$ to be $n$-th Mersenne number mod $b$. The necessary condition for $\ M_b(n)\ $ to be a prime is that $\ n\ $ is a ...
Wlod AA's user avatar
  • 4,786
1 vote
0 answers
274 views

On Primes in Arithmetic Progressions

I was wondering if the following approach is being attempted to prove the twin-prime conjecture. Tao and Green proved in their paper (2006), that there are arbitrarily long arithmetic progressions ...
user136205's user avatar
1 vote
0 answers
165 views

Reference request: Bounding exponential sum $\sum_{x \in [0,X]} \Lambda(x) e(\beta_d x^d + \ldots + \beta_1 x )$

Let $1 \leq i \leq d$, $q \in \mathbb{N}$, and $0 \leq a_{i} < q$. Let $$ \mathfrak{M}^{(i)}_{a_{ i}, q} (C) =\{ \beta_{i} \in [0,1) : | \beta_{i} - a_{i}/q | \leq (\log X)^{C} X^{-i} \} . $$ We ...
Johnny T.'s user avatar
  • 3,625
1 vote
0 answers
140 views

Primes of the form $2^{m_0}p_1^{m_1}\ldots p_r^{m_r}+1$

Is it known any example of a set of primes $\{p_1,\ldots,p_r\}$ with the following property: there are infinitely many $(m_0,\ldots,m_r)\in\mathbb N^{r+1}$ such that $2^{m_0}p_1^{m_1}\ldots p_r^{m_r}+...
Ferra's user avatar
  • 509
0 votes
0 answers
75 views

Existence of smooth integers in every residue class with large modulus

Let us say that a positive integer $x$ is $y$-power smooth, if the largest prime power divisor of $x$ is at most $y$. In what follows, let $C$ be any real number larger than $1$ and, for an integer $x$...
Woett's user avatar
  • 1,663
0 votes
0 answers
83 views

Is it possible to get a conjecture similar to Mandl's conjecture for a different arithmetic function of number theory, mainly related to primes?

I'm curious to know if are in the literature analogous conjectures to the conjecture due to Mandl, I ask about these analogous conjectures for different sequences playing an important role in number ...
user142929's user avatar
0 votes
0 answers
759 views

On sets of coprime integers in intervals

Briefly, Question: Is it "good enough" to use least prime factor in choosing a maximal set of coprime integers in an interval? The post title comes from a 1993 paper of Erdos and Sarkozy. They ...
Gerhard Paseman's user avatar
0 votes
0 answers
116 views

Reference request for bounds of $n$-th composite

Motivation I will briefly elaborate here my motivations for asking the question. If you are not interested in it then please go to the questions. Recently during trying to understand and prove the ...
user avatar
0 votes
0 answers
115 views

What is known about the lower bound for the integers $n$ for which $n$ minus the first $k$ odd primes are $k$ composite numbers?

Question edited in view of the comments below By Yamada's paper we can conclude that if $n>e^{e^{36}}$ be an even number then it can always be written as the sum of a prime and a semi-prime. My ...
user avatar
0 votes
0 answers
142 views

Mobius function on values of an irreducible quadratic polynomial

Are there infinitely many integers $n$ for which $n^2 + 1$ is square-free, and has an even number of (necessarily distinct) prime factors ?
Pablo's user avatar
  • 11.3k