Benford's law: Difference between revisions

</pre>

=={{header|Vlang}}==

{{trans|Go}}

{{libheader|Wren-fmt}}

<lang vlang>import math

fn fib1000() []f64 {

mut a, mut b, mut r := 0.0, 1.0, []f64{len:1000}

for i in 0..r.len {

r[i], a, b = b, b, b+a

}

return r

}

fn main() {

show(fib1000(), "First 1000 Fibonacci numbers")

}

fn show(c []f64, title string) {

mut f := [9]int{}

for v in c {

f["$v"[0]-'1'[0]]++

}

println(title)

println("Digit Observed Predicted")

for i, n in f {

println(" ${i+1} ${f64(n)/f64(c.len):9.3f} ${math.log10(1+1/f64(i+1)):8.3f}")

}

}</lang>

{{out}}

<pre>

First 1000 Fibonacci numbers:

Digit Observed Predicted

1 0.301 0.301

2 0.177 0.176

3 0.125 0.125

4 0.096 0.097

5 0.080 0.079

6 0.067 0.067

7 0.056 0.058

8 0.053 0.051

9 0.045 0.046