## Our proof strategies: an overview

Prerequisite: Goldbach’s conjecture As already indicated, our ultimate goal is to use dashed line theory to prove Goldbach’s conjecture. Dashed…

Multa non quia difficilia sunt non audemus sed quia non audemus sunt difficilia

Prerequisite: Goldbach’s conjecture As already indicated, our ultimate goal is to use dashed line theory to prove Goldbach’s conjecture. Dashed…

This page allows performing the decomposition of a number into its prime factors, and computing the value of some arithmetic…

Looking at a prime numbers table, it's very simple to notice how their distribution seems to escape any regularity; instead…

Almost certainly you already know the factorial function, indicated by x!, which is read as "x factorial" and for an…

With this post we begin an analytical study of the function pi(x), that returns the number of primes less than…

We saw that the product of the first prime numbers can be overestimated by a function of exponential kind with…

We know that a way to compute the least common multiple between two or more integer numbers is based on…

A dashed line can be represented as a table having a fixed number of rows, and, potentially, infinite columns, numbered…

A way to start investigating the sequence of prime numbers is to consider, starting from the beginning, portions of increasing…

We'll start our study of prime numbers explaining the definition of prime number. It's commonly known that a prime number…

The statement phrased by Christian Goldbach is a "conjecture", so, as a matter of principle, it is a hypothesis. This…

Molte cose non è perché sono difficili che non osiamo farle,

ma è perché non osiamo farle che sono difficili

Many times, it is not because things are difficult that we do not dare,

but it is because we do not dare that things are difficult

Seamless Theme Keith, made by Altervista

Create a website and earn with Altervista - Disclaimer - Report Abuse - Privacy Policy - Customize advertising tracking