Primes are KS fundamentally random (but in Hilbert arithmetic, not in the standard mathematics)

30 June 2025, Version 1
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

The paper applies the newly introduced “KS fundamental randomness” to the nonstandardly generalized primes in Hilbert arithmetic to prove that the latter satisfies the necessary condition and separately the sufficient condition of the former. When the two conditions can be identified is also investigated. A review of other available generalizations of primes demonstrates that none of them is suitable for approaching the problem. The design aims to suggest a universal method for resolving number theory puzzles such as Goldbach’s conjecture. The scheme is applicable only within Hilbert arithmetic (but not in the standard mathematics) due to the fact that primes are not KS fundamental random in the latter, but only in the former. “Mathematics enters reality” (though only “fetching” a premise for the proof) is the relevant philosophical reflection furthermore reasoned by the opposition of Hilbert space of dimensions d=1,2 versus d>2 after both Gleason and Kochen - Specker theorems.

Keywords

generalizations of primes
Gleason theorem
Goldbach’s conjecture
Hilbert arithmetic
Kochen - Specker theorem
KS fundamental randomness

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.