Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article
Data sources: ZENODO
addClaim

Computational Evidence for a Conjecture in Number Theory

Authors: SOVEREIGN Research Kernel;

Computational Evidence for a Conjecture in Number Theory

Abstract

We present computational evidence supporting the following conjecture: For any integer n > 1, if n is a perfect power (n = x^a with x>1, a>1), then the distance to the nearest distinct perfect power m (m = y^b, y>1, b>1, m != n) is strictly greater than n^(0.4), with the single exception of n=8 (where the neighbor is 9,. An exhaustive search over 1,000 cases found no counterexample. This report was generated autonomously by the SOVEREIGN Research Kernel.

Powered by OpenAIRE graph
Found an issue? Give us feedback