A circle method approach to K-multimagic squares

Abstract

In this paper we investigate K-multimagic squares of order N, these are N × N magic squares which remain magic after raising each element to the k th power for all 2 ≤slant k ≤slant K. Given K ≥slant 2, we consider the problem of establishing the smallest integer N2(K) for which there exists nontrivial K-multimagic squares of order N2(K). Previous results on multimagic squares show that N2(K) ≤slant(4 K-2)K for large K. Here we utilize the Hardy-Littlewood circle method and establish the bound N2(K) ≤slant 2 K(K+1)+1 Via an argument of Granville's we additionally deduce the existence of infinitely many nontrivial prime valued K-multimagic squares of order 2 K(K+1)+1.

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…