arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.02418math.NTmath.CO
收藏

关于$\{1, 2, ..., n\}$的互素子集数函数的若干性质

On some properties of the function of the number of relatively prime subsets of $\{1, 2, ..., n\}$

Adrian Łydka

摘要:

在本文中,我们解决了几个问题提出的Prapanpong Pongsriiam。令$f(n)$表示$\{1, 2, 3, \dots, n\}$的互素子集的数目,并且$g(n)$表示$\{1, 2, 3, \dots, n\}$的子集$A$的数目,使得gcd $(A)>1$和gcd $(A, n+1)=1$。我们表明,$f_n^2-f_{n-k}f_{n+k}>0$为$n\geq k+1\quad (k\geq2)$。我们还显示了大$n$的$\frac{g(6n-2)}{g(6n-4)}>\frac{g(6n)}{g(6n-2)}>\frac{g(6n+2)}{g(6n)}<\frac{g(6n+4)}{g(6n+2)}$。

英文摘要:

In the paper we solve few problems proposed by Prapanpong Pongsriiam. Let $f(n)$ denote the number of relatively prime subsets of $\{1, 2, 3, \dots, n\}$ and $g(n)$ denote the number of subsets $A$ of $\{1, 2, 3, \dots, n\}$ such that gcd$(A)>1$ and gcd$(A, n+1)=1$ . We show that $f_n^2-f_{n-k}f_{n+k}>0$ for $n\geq k+1\quad (k\geq2)$. We also show $\frac{g(6n-2)}{g(6n-4)}>\frac{g(6n)}{g(6n-2)}>\frac{g(6n+2)}{g(6n)}<\frac{g(6n+4)}{g(6n+2)}$ for large $n$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑