Learn More
We present all solutions to the equation p|N 1 p + 1 N = 1 with at most eight primes, improve the bound on the nonsolvability of the Erdös-Moser equation m−1 j=1 j n = m n , and discuss the computational search techniques used to generate examples of perfectly weighted graphs. k i=1 1 n i + k i=1 1 n i = 1, (1) n 1 < n 2 < · · · < n k , has sparked renewed(More)
  • 1