Predicting the size ranking of minimal primes in the generalised Goldbach partitions
arXiv:2510.21870
Abstract
A scarcely known generalization of Goldbach's conjecture introduced by Hardy and Littlewood states that for every pair of (relatively prime) positive integers m1 and m2, every sufficiently large integer n satisfying certain simple congruence criteria can be -partitioned as for some primes and . While the size of the minimal prime in the Goldbach partitions of even numbers has received prior attention, we extend this investigation to the general case of -partitions. This question has a direct implication on the running times of verification algorithms of the generalised Goldbach conjecture. We study the rankings of the pairs according to the sizes of the averages and maxima, respectively, of the minimal in the -partitions of numbers up to large thresholds, and propose a rank-order predicting function depending only on m2 and the prime factors of . We computed both the average and the maximum of the minimal prime in all -partitions of integers up to , for every pair of relatively prime coefficients . Our function shows very high rank-order correlations with both the empirical averages and maxima of the minimal primes (Spearman's and , respectively). It also correctly predicts trends in the experimental data, for example, that for all relatively prime , the average minimal in the -partitions of numbers up to exceeds the analogous average for the -partitions. We present numerical data, including the average and the maximum of the minimal in the -partitions of numbers up to for each pair relatively prime, and the resulting size rankings.