On the Diophantine equation σ2(Xn)=σn(Xn)

Abstract

In this note we investigate the set S(n) of positive integer solutions of the title Diophantine equation. In particular, for a given n we prove boundedness of the number of solutions, give precise upper bound on the common value of σ2(Xn) and σn(Xn) together with the biggest value of the variable xn appearing in the solution. Moreover, we enumerate all solutions for n≤ 16 and discuss the set of values of xn/xn-1 over elements of S(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…