code wiki / (root) / nx_theorems6_test.nx

nx_theorems6_test.nx

buildroot/runtime/nx_theorems6_test.nx

5372 B119 linesdepth 6pulls 12 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_theorems6_test.nx -- Freek-100 medium difficulty smoke.

dependencies 5 imports · 0 importers

syscalls.nx nx_complex.nx nx_poly.nx nx_graph.nx nx_qed_freek.nx nx_theorems6_test.nx

imports: syscalls.nxnx_complex.nxnx_poly.nxnx_graph.nxnx_qed_freek.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main nx_th_demoivre_i_power_4_c nx_cx_alloc nx_cx_set nx_cx_pow nx_cx_alloc ↻ nx_cx_mul nx_muldiv_i64 nx_i128_alloc nx_i128_mul_i64 nx_i128_mul_u64 nx_i128_neg nx_i128_div_i64 nx_i128_is_neg nx_i128_neg ↻ nx_i128_udiv_u64 nx_th_demoivre_i_power_2_c nx_cx_alloc ↻ nx_cx_set ↻ nx_cx_pow ↻ nx_th_triangle_angle_sum_c nx_th_cubic_discriminant nx_muldiv_i64 ↻ nx_th_konigsberg_check sys_mmap nx_graph_has_eulerian_circ nx_graph_degree nx_th_power_of_point_check nx_muldiv_i64 ↻ nx_th_perfect_number nx_th_mersenne_prime_check nx_muldiv_i64 ↻ nx_th_is_perfect_brute nx_th_erdos_szekeres_check nx_th_lis_length sys_mmap ↻ nx_th_lds_length sys_mmap ↻ nx_th_lis_length ↻ nx_th_faulhaber_p_check

structs

none

consts

none

functions

9func main() -> i64 {
calls 24: nx_th_demoivre_i_power_4_checknx_th_demoivre_i_power_2_checknx_th_triangle_angle_sum_checknx_th_cubic_discriminantnx_th_konigsberg_checknx_th_power_of_point_check+18