Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
0 answers
171 views

An inequality involving integer partitions

For integers $n\ge k\ge0$, let $p(n,k)$ denote the number of ways to write $n$ as a sum of $k$ positive integers (repetition allowed). For example, $p(6,3)=3$ since $$6=1+1+4=1+2+3=2+2+2.$$ QUESTION. ...
Zhi-Wei Sun's user avatar
  • 15.6k
5 votes
0 answers
183 views

On the polynomials $\sum_{k=0}^n\binom{n+k}k^m q^k$

A sequence of polynomials $$P_0(q),\ P_1(q),\ P_2(q),\ \ldots$$ with real coefficients is called $q$-log-convex if for each $n=1,2,3,\ldots$ every coefficient of the polynomial $P_{n+1}(q)P_{n-1}(q)-...
Zhi-Wei Sun's user avatar
  • 15.6k
2 votes
0 answers
76 views

upper and lower bounds on rowlands sequence

rowlands sequence is defined as follows \begin{equation} a_{n}=a_{n-1} + b_{n} \end{equation} where $b_{n} = gcd(a_{n-1}, n)$ for $n>h$ it originates from E. Rowlands 2008 paper "A Natural ...
Antisocialfreal's user avatar
3 votes
1 answer
233 views

Min problem on integers

Let $n$ be any integer greater than $2^{10^6}$. Given any $s\le (\log_2 n)/1000$ integers $1=q_1\le q_2\le \cdots q_{s-1}\le q_s=n$. Prove that $$\min_\ell\left(\sum_{i=1}^\ell q_i\right)\left(\sum_{i=...
Nader Bshouty's user avatar
4 votes
0 answers
121 views

$f(n) = \frac{n^2 + n + 4}{2}$, $g(f(n)) = f(g(n))$ such that $g(n)$ is an integer

Let $n$ be a strict positive integer and let's define an integer sequence $f(n)$ : $$f(n) = \frac{n^2 + n + 4}{2}$$ so $$ \begin{split} f (\Bbb N)& \triangleq {3,5,8,12,17,23,30,38,47,\ldots}\\ f(...
mick's user avatar
  • 763
1 vote
0 answers
182 views

Ask for a proof of an inequality involving the Bernoulli numbers

Let $B_k$ be the Bernoulli numbers and let \begin{equation} T_k=\frac{2^{2k}}{(2k)!}|B_{2k}|, \quad k\ge1. \end{equation} Prove the inequality \begin{equation*} \frac{\frac{1}{k+2}\sum_{j=0}^{k+1}\...
qifeng618's user avatar
  • 1,101
4 votes
1 answer
168 views

An inequality involving $k$-generalized Fibonacci numbers

I have worked on a Diophantine equation by using transcendental and reduction methods given by Baker and Davenport. However, to solve completely the equation I have one complicated case and I proved ...
Davi's user avatar
  • 41