2. h : {2..(n+1)
}
3. n =
{2..n+1}(h)
4. is_prime_factorization(2; (n+1); h)
5. x : {2..(n+1)
}
6. prime(x)
h(x) = prime_mset_complete(complete_intseg_mset(2; (n+1); h))(x)}
{2..n+1}(h)
}
h(x) = prime_mset_complete(complete_intseg_mset(2; (n+1); h))(x)| By: |
 f:(Prime), x:Prime. prime_mset_complete(f)(x) = f(x) |
| 1 |
h(x) = complete_intseg_mset(2; (n+1); h)(x) | 1 step |
About:
 |  |  |  |  |  |  |