Asymptotics for Magic Squares of Primes

arXiv1207.3936MaRDI QIDQ6234435FDOQ6234435

Carlos Vinuesa

Publication date: 17 July 2012

Abstract: Based on the work of Green, Tao and Ziegler, we give asymptotics when $Noinfty$ for the number of $nimesn$ magic squares with their entries being prime numbers in $[0,N]$. For every $nge3$ we give appropriate systems of linear forms (or equivalently basis) describing all $nimesn$ magic squares with integer entries and we calculate the complexity of these systems in the Green and Tao sense. We compute the precise asymptotics for the cases $n=3$ (complexity 3) and $n=4$ (complexity 1), and the given algorithm works for $nge5$ (complexity 1). Finally, we show that the asymptotics are exactly the same if we impose that all the entries of the magic squares have to be different.

This page was built for publication: Asymptotics for Magic Squares of Primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234435)