k:{2...}, n:
, g:({2..k
}
).
2 
n < k+1
(i:{2..k}. ni 0<g(i) prime(i))
(
h:({2..k}).
(
{2..k}(g) = {2..k}(h) & is_prime_factorization(2; k; h)) k:{2...}, n:, g:({2..k}).
2 n < k+1
(i:{2..k}. ni 0<g(i) prime(i))
(h:({2..k}).
({2..k}(g) = {2..k}(h) & is_prime_factorization(2; k; h))| By: |
|
| 1 |
2. n :
3. n1:.
3. n1<n 3.
3. ( g:({2..k}).
3. (2 n1 < k+1
3. (
3. (( i:{2..k}. n1i 0<g(i) prime(i))
3. (
3. (( h:({2..k}).
3. (( {2..k}(g) = {2..k}(h) & is_prime_factorization(2; k; h)))
4. g : {2..k }
5. 2 n
6. n<k+1 7. i:{2..k}. ni 0<g(i) prime(i)
h:({2..k}).
{2..k}(g) = {2..k}(h) & is_prime_factorization(2; k; h) | 12 steps |
About:
 |  |  |  |  |  |
 |  |  |  |
 |