2000 character limit reached
On some properties of the function of the number of relatively prime subsets of $\{1, 2, ..., n\}$
Published 6 Oct 2019 in math.NT and math.CO | (1910.02418v1)
Abstract: 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_n2-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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.