All Questions
19 questions with no upvoted or accepted answers
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
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\...
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$ ...
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
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
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 ...
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,\...
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 $...
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 $...
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\{...
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
vote
0
answers
59
views
A question on generalized bases
I just came to know that it is possible to define a generalized base as an infinite sequence of natural numbers $\mathbf b=(b_1,b_2,\dots)$ where $b_i\ge 2$ for all $i$. With this definition, any $m\...
1
vote
0
answers
123
views
On probability of coprimality of a list of numbers
We know $r$ randomly chosen integers are coprime with probability $\frac1{\zeta(r)}$.
Pick a bound $N$ and pick $k\lceil N^{\alpha}\rceil$ uniformly random integers in $[0,N^{\alpha+\beta}]$ where $\...
1
vote
0
answers
134
views
Number of solutions to a diophantine equation
Given a positive integer $n$, consider the diophantine equation $4x^2+y^2+4x+y=2n$ with solutions in non-negative integers $x$ and $y$.
Define the proportion
$$\delta_n=\frac{\#\{(x,y)\in\mathbb{Z}^2_{...
1
vote
0
answers
126
views
What is the order of binary partition function when number of partitions is fixed?
Given a number $N$, the number of ways to write it as a sum of powers of $2$ is called the binary partition function of $N$ and is well studied. But if the number partitions are fixed, then how do you ...
1
vote
0
answers
80
views
Number of integers in relation to Pythagorean triples with some quadratic relations
Given an integer $m>0$ possibly composite we can find non-negative integers which are not equivalent to $0\bmod m$ with
$$ab+cd\equiv0\bmod m$$.
Is there any integer quadruples bounded in $[0,m-1]^...
1
vote
0
answers
126
views
How many solutions to $p_i|a_{i,1} p_1 + \dotsc + a_{i,n} p_n$?
Consider a system of $n$ divisibility conditions on $n$ prime variables:
$$p_i|a_{i,1} p_1 + \dotsc + a_{i,n} p_n,\;\;\;\;\;1\leq i\leq n,$$
where $a_{i,j}$ are bounded integers. How many solutions ...
0
votes
0
answers
128
views
Number of primes skipped by binomial coefficients?
Take $$B(l,n)=\binom{n+l}{n}$$ and $\mathcal P(t)=\{p\mbox{ prime}:p|t\}$.
What is the cardinality of $\mathcal P(B(l,n))$?
What is minimum cardinality of $L\subseteq\{1,\dots,n\}$ such that $$\...
0
votes
0
answers
126
views
Non existence (or existence) of a set that is equidistributed modulo $q$ for every $q$
I have been thinking about some set that is equidistributed modulo $q$,
uniformly in $q$ in some sense. I was starting to think this particular condition, which I describe below, is too strong and ...