Ciro Santilli @cirosantilli  40

They have some kind of cryptocurrency, TCHME token, as a reward. Ciro wonders if the value of TCHME will ever be high enough to serve as a valid incentive.

Also, what is the total TCHME supply? Can the website devs issue as much as they want? They do giveaways e.g. as shown at: twitter.com/TeachMeAsap/status/1621353671840899072

And a centralized system with a certralized marketplace would work just as well for the initial phases. But fair play, the idea is interesting.

 Read the full article

Fermat's last theorem Updated 2026-01-30

 View more

A generalization of the Pythagorean triple infinity question.

 Read the full article

Classification of Pythagorean triples Updated 2025-07-16

 View more

en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple

 Read the full article

There are infinitely many Pythagorean triples Updated 2025-07-16

 View more

Direct consequence of Euclid's formula.

 Read the full article

prime-number-theorem Updated 2025-07-16

 View more

Consider this is a study in failed computational number theory.

The

n / l n (n)

approximation converges really slowly, and we can't easy go far enough to see that the ration converges to 1 with only awk and primes:

sudo apt intsall bsdgames
cd prime-number-theorem
./main.py 100000000

Runs in 30 minutes tested on Ubuntu 22.10 and P51, producing:

Figure 1.
Linear $π (n)$ vs $n / l n (n)$ approximation plot
. $f (n) = n$ and $f (n) = l o g (n)$ are added to give a better sense of scale. $l o g (n)$ is too close to 0 and not visible, and the approximation almost overlaps entirely with $p i$ .

Figure 2.
$π (n) - n / l n (n)$
. It is clear that the difference diverges, albeit very slowly.

Figure 3.
$π (n) / (n / l n (n))$
. We just don't have enough points to clearly see that it is converging to 1.0, the convergence truly is very slow. The logarithm integral approximation is much much better, but we can't calculate it in awk, sadface.

But looking at: en.wikipedia.org/wiki/File:Prime_number_theorem_ratio_convergence.svg we see that it takes way longer to get closer to 1, even at

1 0^{24}

it is still not super close. Inspecting the code there we see:

(* Supplement with larger known PrimePi values that are too large for \
Mathematica to compute *)
LargePiPrime = {{10^13, 346065536839}, {10^14, 3204941750802}, {10^15,
     29844570422669}, {10^16, 279238341033925}, {10^17,
    2623557157654233}, {10^18, 24739954287740860}, {10^19,
    234057667276344607}, {10^20, 2220819602560918840}, {10^21,
    21127269486018731928}, {10^22, 201467286689315906290}, {10^23,
    1925320391606803968923}, {10^24, 18435599767349200867866}};

so OK, it is not something doable on a personal computer just like that.

 Read the full article

Twin prime Updated 2025-07-16

 Read the full article

Admissible prime k-tuple Updated 2025-07-16

 Read the full article

Perfect information Updated 2025-07-16

 Read the full article

 There are unlisted articles, also show them or only show them.