user
It is conjectured that each decimal digit will occur with the same frequency in the mathematical constant e, see: the Wikipedia page on e.  
This task is to count and display (here on this page) how many times each digit occurs, up to some "large" number of fractional digits.

Notes

A B program to calculate the first 4000 fractional digits is on the Wikipedia here: B (programming language)  
The algorithm shown is from Ken Thompson's *Users' Reference to B* manual and does not require big-integers.

This Redit article draws a graph of the first 100 digits.
assistant
```
constant 𝑒 = [\+] flat 1, [\/] 1.FatRat..*;

sub e-count ($n) {
    my @digits = 𝑒[$n / 2.7].substr(0,$n+1).comb.classify(*).sort.skip(1).map: {.key => .value.elems};
   .say for @digits;
   say 'Total digits: ', @digits».value.sum;
   say '';
}

.&e-count for 4000, 6000;

```

Output:

```
0 => 396
1 => 395
2 => 390
3 => 403
4 => 387
5 => 390
6 => 422
7 => 408
8 => 397
9 => 412
Total digits: 4000

0 => 602
1 => 592
2 => 604
3 => 625
4 => 559
5 => 586
6 => 644
7 => 600
8 => 597
9 => 591
Total digits: 6000
```