Skip to main content

NUMBERS' PLANE

Search This Blog

Decomposition of the Möbius function - the key to proving the truth of RH?

Autor: Marcin Leśniak w dniu November 29, 2021

Introduction of the notions of the relative Möbius and Mertens functions as a key for proving RH.

Below you can find the link to the paper being the sketch of such proof.

Comments

Post a Comment

Popular Posts

On the density of Euler’s Phi function of the sets of numbers in form of p+/-n and their relation to Artin’s constant

It’s well known that the average density of Euler’s Phi (totient) function (stated as Phi(n)/n ) within all the natural numbers, or their long enough subset (including randomly chosen) is equal to We can wonder then what are the average densities of Phi of some specific subsets of the Natural numbers. Creating such a subset starting from some number m and including into it every n th number (so for example starting from 5 and taking every 3 rd one: 5, 8, 11, 14…) makes the case trivial – as expected such average density (let’s call it D(S)) is simply dependent on the divisors of m and n (arranged in a simple formula and multiplied by the 1/Zeta(2) ), so it’s not worthy of being considered here. That’s why the average density of Phi of even numbers is equal to and odds is equal to It's also obvious that the density of the set consisting of only primes naturally tends to 1 when the size of the set tends to infinity, since the Phi(p) = p -1 But ...

What the NUMBERS' PLANE is?

It's the most natural, geometric representation of the numbers treated as the complex objects. In contrast to the plane of complex numbers, where a number is represented as a single point, here each number n is represented by n points (unities) distributed equally on a circle of radius n. Such arrangement of the numbers (their unities) on the plane allows immediately to naturally decode their most important feature - DIVISIBILITY. Every number has its own unique PATTERN OF DIVISIBILITY showing how the given number is divisible by all the other numbers smaller than itself. Red unities are these, which are relatively prime to all the other unities belonging to numbers smaller than n. Patterns of divisibility in a linear form: Quantities of relatively prime unities within given number represent naturally the value of the Euler's Phi(n) function , and here, apart from the value itself, we also have its geometric representation. What is extremely ...

Insights on the Black Holes information paradox from the behavior of the entropy of the Euler’s totient function

At the very beginning let’s define what the entropy of Euler’s totient function is. Let’s start with the implementation of the notion of the Euler’s totient function ( Phi ) density within the given set of numbers D[S(N)]. In simple words, the density of Phi function of some set of numbers is equal to the sum of all the values of Phi function of all the numbers within a given set divided by the sum of all these numbers. It is well known that the density of the set of all the natural numbers is equal to But the densities of the subsets of the natural numbers may take different values and what’s crucial their behavior might be very regular, depending on the “algorithm” of our choice. More about the interesting behavior of the density function you can find in my other post here . Choosing the set of N numbers from all the natural numbers we can make it using either some kind of pattern or make it more random. The key feature of the density function of the chosen set of numbers...

Powered by Blogger

Marcin Leśniak