All Questions
69 questions
58
votes
3
answers
6k
views
Number of elements in the set $\{1,\cdots,n\}\cdot\{1,\cdots,n\}$
Let $A_n=\{a\cdot b : a,b \in \mathbb{N}, a,b\leq n\}$. Are there any estimates for $|A_n|$? Will it be $o(n^2)$?
- 897
54
votes
2
answers
8k
views
Walsh Fourier transform of the Möbius function
This question is related to this previous question where I asked about ordinary Fourier coefficients.
Special case: is Möbius nearly orthogonal to Morse
August Ferdinand Möbius (November 17, 1790 – ...
38
votes
2
answers
5k
views
Is the set of primes "translation-finite"?
The definition in the title probably needs explaining. I should say that the question itself was an idea I had for someone else's undergraduate research project, but we decided early on it would be ...
- 25.8k
37
votes
3
answers
2k
views
How to prove the identity $L(2,(\frac{\cdot}3))=\frac2{15}\sum\limits_{k=1}^\infty\frac{48^k}{k(2k-1)\binom{4k}{2k}\binom{2k}k}$?
For the Dirichlet character $\chi(a)=(\frac a3)$ (which is the Legendre symbol), we have
$$L(2,\chi)=\sum_{n=1}^\infty\frac{(\frac n3)}{n^2}=0.781302412896486296867187429624\ldots.$$
Note that this ...
- 15.6k
23
votes
3
answers
3k
views
How many different numbers can be obtained as product of first $n$ natural numbers?
Let m and n be natural numbers, and consider the set of all possible products of m (not necessarily distinct) elements from the set $\{1,2,\ldots,n\}$, that is consider the set
$\{1^{a_1} \cdot 2^{...
- 323
19
votes
1
answer
3k
views
Möbius Randomness of the Rudin-Shapiro Sequence
The Rudin-Shapiro sequence (also known as the Golay-Rudin-Shapiro sequence) is defined as follows.
Let $a_n = \sum \epsilon_i\epsilon_{i+1}$ where $\epsilon_1,\epsilon_2,\dots$ are the digits in the ...
- 24.7k
16
votes
4
answers
10k
views
Exact formulas for the partition function?
I am curious, what kind of exact formulas exist for the partition function $p(n)$?
I seem to remember an exact formula along the lines $p(n) = \sum_k f(n, k)$, where $f(n, k)$ was some extremely ...
- 7,337
16
votes
2
answers
1k
views
The Stable Set Conjecture
A set $\mathcal S$ of positive integers is called stable if for every fixed positive integer $d$, the relation
$$n\in \mathcal S \iff dn\in \mathcal S$$
holds for almost all positive integers $n$. ...
- 791
15
votes
4
answers
2k
views
On the vanishing of the generalized von Mangoldt function $\Lambda_k(n)$ when $n$ has more than $k$ prime factors
It is a well-known fact that the generalized von Mangoldt function, defined by
$$\displaystyle \Lambda_k(n) = \sum_{d | n} \mu(d) \left(\log \frac{n}{d}\right)^k$$
vanishes whenever $n$ has more ...
- 26.9k
14
votes
1
answer
991
views
Szemeredi's theorem in the Gaussian integers
Suppose that $S\subseteq\mathbb{Z}[i]$ has the following properties:
For convenience, let $A_n = \{z : z\in\mathbb{Z}[i], \text{Nm}(z)\le n\}$
$$\limsup_{n\rightarrow\infty} \frac{|S\cap A_n|}{|A_n|}...
- 1,890
12
votes
2
answers
743
views
Smallest set such that all arithmetic progression will always contain at least a number in a set
Let $S= \left\{ 1,2,3,...,100 \right\}$ be a set of positive integers from $1$ to $100$. Let $P$ be a subset of $S$ such that any arithmetic progression of length 10 consisting of numbers in $S$ will ...
- 179
10
votes
3
answers
1k
views
Explicit formula for elementary symmetric sum
For $k\ge1$, $j\ge1$, Let $$e_k(j)=\sum_{1\le i_1<...<i_k\le j}i_1\cdot\cdot\cdot i_k.$$ We know that $e_k(j)$ is a polynomial in $j$ with coefficients depending on $k$. I am curious about ...
- 113
8
votes
2
answers
1k
views
Prime plus square equals prime
Furstenberg–Sárközy's theorem states that if a set of positive integers has positive upper density, then there exists (infinitely many) pair of elements of the set, whose difference is a perfect ...
- 191
8
votes
1
answer
575
views
Unstable Integers
There is a question that has been bothering my mind for quite a while now. I will present it and my current thoughts and progress on it.
Let the prime factorization of an integer $n$ be
$$n = p_1^{...
- 311
6
votes
1
answer
305
views
Are the Fourier coefficients of $\eta(q^m)^m / \eta(q)$ non-negative?
In this paper, the following result is proved.
For any prime $p$, all the Fourier coefficients of
$$\eta(q^p)^p / \eta(q) = q^{\frac{p^2-1}{12}} \prod_{n=1}^\infty (1 - q^{pn})^p (1 - q^{n})^{-1}$$
...
- 427
6
votes
2
answers
385
views
Is the nth-power-sum graph connected?
This post was inspired by the Square-Sum Problem presented in Numberphile by Matt Parker.
He asked about Hamiltonianness for $n=2$, and we ask about connectedness for all $n \in \mathbb{N}^*$.
...
6
votes
2
answers
297
views
Minimal period of arithmetic progressions occurring in sets of positive density.
Let $A$ be a subset of ${\mathbb N}$ with positive upper-Banach density, and for each integer $k\geq3$, define $R_k=R_k(A)$ to be the smallest positive integer $r$ such that $A$ contains a length $k$ ...
- 63
6
votes
1
answer
1k
views
Jacobsthal function related to squares
The ordinary Jacobsthal function $j$ is defined by setting $j(n)$ as the smallest number $m$ such that, for each consecutive $m$ integers, at least one of the numbers is coprime to $n$. There are ...
- 397
5
votes
1
answer
474
views
Dynamics in the integers - Floor function
Let $\alpha$ be an irrational with $0<\alpha<1$. Consider the function given by \begin{align*}
f: &\mathbb{N}\longrightarrow \mathbb{N}\\ &x\longmapsto [ \alpha\cdot x]\end{align*} where ...
- 167
5
votes
1
answer
2k
views
Is there a relation between the number of lattice points lie within these circles
Suppose we have a circle of radius $r$ centered at the origin $(0,0)$. The number of integer lattice points within the circle, $N$, can be bounded using Gauss circle problem.
Suppose that another ...
- 225
5
votes
2
answers
445
views
summation of products of combinatorials
For any natural number $N$ and $0\le n\le N$ define
$$
f(n) = f(n,N) = \frac{1}{(N+1)!} \sum_{\substack{{S\subset \{1,\ldots,N\}} \\ {|S|=n}}} \prod_{s\in S} s.
$$
(The empty product is interpreted ...
- 61
5
votes
0
answers
355
views
What is the sum of the binomial coefficients ${n\choose p}$ over prime numbers?
What is known about the asymptotics, lower and upper bound of the sum of the binomial coefficients
$$
S_n = {n\choose 2} + {n\choose 3} + {n\choose 5} + \cdots + {n\choose p}
$$
where the sum runs ...
- 5,470
5
votes
0
answers
170
views
operation on Ord., Exp., Dri. generating functions
The ordinary, exponential and Dirichlet generating functions for a sequence $\{a_n\}_{n\geq0}$ are given (at least on the formal side), respectively, by
$$F(x)=\sum_{n\geq0}a_nx^n, \qquad E(x)=\sum_{n\...
- 43.2k
4
votes
1
answer
464
views
Odd Chebyshev, part 2
Let
$$ \forall_{n=1\ 2\ \ldots}\quad I(n)\ :=\
\frac {(6\cdot n-3)!!}{(2\cdot n-1)!!\cdot(4\cdot n-3)!!} $$
Let $\ M(n)\ $ be the smallest natural number such that
$$ M(n)\cdot I(n)\ \...
- 7,500
4
votes
1
answer
346
views
Existence of a certain subset of natural numbers equidistributed modulo $m$ for every $m$
I was talking to a friend and the following set $S$ came up.
Let $f$ be some real valued function tending to infinity.
Let $S$ be a subset of natural numbers such that $|S \cap [1,N]| = N^{\delta}+ O(...
- 579
4
votes
2
answers
492
views
Distance between primes that are quadratic residues modulo an other prime
Question: Is there an infinite sequence of primes $\{q_i\}_{i=1}^{\infty}$ that is not too sparse ( $q_n =O(poly(n))$ for a fixed polynomial) for which it is true that for every $k$ there is an $N(k)$ ...
- 3,004
4
votes
1
answer
260
views
Kummer's congruence at $p=3$
Let $B_{2k}$ be the Bernoulli numbers of even index and $\varphi(n)$ be Euler's totient function. We recall one instance of Kummer's congruences: for each integer $m\geq1$ and a prime number $p\geq5$, ...
- 43.2k
4
votes
1
answer
391
views
A question concerning products of finite cyclic groups
Let $m_1,\ldots, m_n$ be pairwise coprime natural numbers $\geq 1$. We consider the product $$G(m_1,\ldots,m_n) := \prod_{i=1}^{n} \mathbb{Z} / m_i \mathbb{Z}.$$ We define $M(n)$ as the set $n$-tuple ...
- 397
4
votes
1
answer
314
views
Asymptotic for number of partitions of $n$ into $k$ squares, uniform in $n,k \to +\infty$
Let $p^{(s)}(n)$ be the number of ways of writing the positive integer $n$ as a sum of perfect $s$-powers, where the order does not matter. For example, $p^{(2)}(9) = 4$ since
$$9 = 1^2 + 1^2 + 1^2 + ...
- 41
4
votes
0
answers
231
views
How big are small inverse powers of 2 mod powers of 3?
Let $a \bmod b$ take value as an integer in $[0, b)$. For any $T \ge 1$, for what $R \in [0, 3^n)$ is
$$\min \{2^{-t}\bmod 3^n: t =1, \dotsc, T\} := \min A_T > R?$$
When $T$ is fixed as $n$ ...
- 459
4
votes
0
answers
191
views
Overview of Combinatorial Technique of "Selberg’s Symmetry Formula"
In the paper entitled "A Computational History of Prime Numbers and Riemann Zeros" (on page 4, click here) it is written about "Selberg’s symmetry formula" that-
Until 1950 it was widely believed (...
3
votes
1
answer
655
views
Separating Gamma in two independent functions
I've encountered a problem in my PhD. I would greatly appreciate any suggestions, tips, or comments you might have. The problem is
Let $\Gamma(s,x)$ be the incomplete gamma function. Given integers $n ...
- 41
3
votes
2
answers
641
views
Computing hypergeometric function at 1
I'm looking to compute
$${}_ 3F_ 2\biggl(\begin{matrix} -m-1/2,\ -m,\ k-m+1/2 \cr
1/2-m,\ k-m+3/2\end{matrix};1\biggr)$$
for $m,k > 0$ are positive integers and $0 < k < m$. I'm wondering if ...
- 337
3
votes
1
answer
372
views
How many ways can $N$ be written as a sum of terms in the form $2^i3^j$?
Given a positive integer $N$, let $f(N)$ be the number of ways $N$ can be decomposed as a sum of terms of the form $2^i3^j$, where each such term appears at most once in the sum. For example, $f(10) = ...
- 1,703
3
votes
1
answer
312
views
Congruences for power-sum of divisors
If $\sigma_k(n)=\sum_{d\vert n} d^k$, denote
$$F_1(q)=\sum_{n\geq1}\sigma_1(n)\,q^n \qquad \text{and} \qquad
F_3(q)=\sum_{n\geq1}n\cdot\sigma_2(n)\,q^n.$$
QUESTION. Assume the prime $p$ is either $2,...
- 43.2k
3
votes
4
answers
280
views
Approximately satisfying simultaneous vector linear diophantine equations?
Pick three $a,b,c$ vectors in $\mathbb Z^n$ uniformly with $\max(\|a\|_\infty,\|b\|_\infty)<T$ and $\|c\|_\infty<T^2$ and an $\epsilon>0$.
Assume $a$ and $b$ are coordinatewise coprime (...
- 13.9k
3
votes
1
answer
855
views
Infinite dimensional lattice for integers and the Riemann hypothesis?
It is known that for each finite set of primes $p$ we have: $\log(p)$ are linear independent over the rational numbers.
We have $\log(ab) = \log(a)+\log(b)$ and $\log(n) = \sum_{p |n}v_p(n) \log(p)$.
...
- 3,064
3
votes
0
answers
157
views
Combinatorial interpretation for Möbius-poly-Bernoulli numbers
The Möbius-Bernoulli numbers ,are related to Dedekind Sums
$$\sum_{d|n}\frac{t\mu(d)}{e^{td}-1}=\sum_{k=0}^\infty M_k(n)\frac{t^k}{k!}$$ where $|t|<\frac{2\pi}{n}$, and $M_k(1)=B_k$.
We define the ...
user160903
3
votes
0
answers
148
views
Maximum number of integral roots in degree $d$ polynomial?
Given $f(x_1,\dots,x_n)\in\mathbb Z[x_1,\dots,x_n]$ such that
Each coefficient is bound in absolute value by $B$
Degree of each variable in any monomial is bound by $d$
Total degree is $d'$
$f(x_1,\...
- 13.9k
3
votes
0
answers
131
views
Chen primes and permutations
In 1973 the Chinese mathematician J.-R. Chen proved that there are infinitely many primes $p$ such that $p+2$ is a product of at most two primes. Nowadays such primes $p$ are called Chen primes.
For $...
- 15.6k
3
votes
0
answers
320
views
On sets of coprime numbers
We know that from prime number theorem that the number of primes below $n$ and above $\frac n2$ (denoted by $\pi_{n,\frac n2}$ is approximately $$\pi_{n,\frac n2}\approx\frac{n}{2\ln n}.$$
Denote by $...
user76479
2
votes
2
answers
283
views
Expressions for binomial residue sum $\sum_{k=0}^n {n \choose k} x^k \left( \frac{k}{q} \right)$
I'm interested in the sum:
$$\sum_{k=0}^n {n \choose k} x^k \left( \frac{k}{q} \right)$$
where $q$ is a prime number. This is just the binomial expansion with an extra weight on quadratic residues ...
- 591
2
votes
1
answer
110
views
Asymptotic behavior in a modular color-cycling problem
Consider the following problem: We have $k$ rooms, each equipped with a light that cycles through three colors – red, green, and blue – in a cyclic order. Initially, all lights are set to red. Each of ...
2
votes
1
answer
191
views
Representation numbers of numerical semigroups
I've been playing around with numerical semigroups lately. I'm pretty new to this stuff, so I apologize in advance if my notation is non-standard. Fix positive integers $x_1,\dots,x_r$ with $\gcd(x_1,\...
- 21
2
votes
1
answer
215
views
The growth of the number of Fano complete intersection families
I recently calculated the number (possible multidegrees) of Fano complete intersections of dimension $n$ , because I wanted to make the remark that it grows "very rapidly" as $n \rightarrow \...
- 6,995
2
votes
1
answer
273
views
Primes in modular arithmetic progression
Fix a prime $p$.
I want to get $k<p$ primes $p_1<\dots<p_k$ such that at every $i\in\{1,\dots,k\}$ we have
$$p_i\equiv (2i+1+c)\bmod p$$ where $c$ is fixed and $2k+1+c<p$ holds.
For a ...
- 13.9k
2
votes
1
answer
423
views
Essential clarifications on application of pigeonhole principle
In here Lemma $4$ using pigeonhole says:
For $T_1,\dots,T_s\in\Bbb R$ with $1\leq T_1,\dots,T_s<p$ and $\prod_{i=1}^sT_i > p^{s−1}$ and any integers $a_1,\dots,a_s$ there is an integer $t$ ...
user94040
2
votes
0
answers
286
views
Is Sturm's theorem able to do these?
$\newcommand{\Ord}{\operatorname{Ord}}$Let $p$ be a positive integer and $F(q)=\sum A(m)q^m$ be a formal power series with integer coefficients. Then $\Ord_p(F(q))$ is defined by
$$\Ord_p(F(q)):=\min\{...
- 43.2k
2
votes
0
answers
156
views
Questions about a certain sequence of naturals generated by primorials
I'm working on the following sequence of naturals (which is NOT listed in OEIS)
$$3,5,11,17,23,29,59,89,119,149,179,209,419,629,839,1049,1259,1469,1679,...$$
whose elements are generated this way
$$3=(...
- 1,008
1
vote
4
answers
1k
views
Distribution of composite numbers
I have moved this question to math.stackexchange.com. People who are interested in this question can discuss at :https://math.stackexchange.com/questions/1272431/distribution-of-composite-numbers
...
- 787