On the log-concavity of n-th root of a sequence
Abstract
In recent years, the log-concavity of \[n]Sn\n≥ 1 have been received a lot of attention. Very recently, Sun posed the following conjecture in his new book: the sequences \[n]an\n≥ 2 and \ [n]bn\n≥ 1 are log-concave, where \[ an:= 1nΣk=0n-1 n-1 k2n+k k2 4k2-1 \] and \[ bn:= 1n3Σk=0n-1 (3k2+3k+1)n-1 k2 n+k k2. \] In this paper, two methods, semi-automatic and analytic methods, are used to confirm Sun's conjecture. The semi-automatic method relies on a criterion on the log-concavity of \[n]Sn\n≥ 1 given by us and a mathematica package due to Hou and Zhang, while the analytic method relies on a result due to Xia.
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.