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

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, …, n\ and g(n) denote the number of subsets A of \1, 2, 3, …, n\ such that gcd(A)>1 and gcd(A, n+1)=1 . We show that fn2-fn-kfn+k>0 for n≥ k+1 (k≥2). We also show g(6n-2)g(6n-4)>g(6n)g(6n-2)>g(6n+2)g(6n)<g(6n+4)g(6n+2) for large n.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…