On Tuesday, 25 June 2024 at 06:44:28 UTC, Salih Dincer wrote:
I'm not sharing the code for now because
it's a challenge.
Since we couldn't get a code snippet, I'd like to share some
framing code without answers:
```d
struct SumPrimes(size_t size)
{
import std.bigint;
auto next = BigInt
Hello, I discovered something about octal prime numbers. I don't
know if anyone has dealt with this before, but thanks to the
power of the D programming language, it was very easy. So, by
defining a range with the empty(), front() and popFront()
functions, I produced an output, something like t
