{"id":20160149,"url":"https://github.com/trizen/sidef-scripts","last_synced_at":"2026-03-10T06:03:40.006Z","repository":{"id":43676197,"uuid":"73223099","full_name":"trizen/sidef-scripts","owner":"trizen","description":"A nice collection of Sidef scripts.","archived":false,"fork":false,"pushed_at":"2026-02-24T14:05:24.000Z","size":1686,"stargazers_count":9,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2026-02-24T18:52:53.234Z","etag":null,"topics":["math","scripts","sidef","sidef-scripts","utils"],"latest_commit_sha":null,"homepage":"https://github.com/trizen/sidef","language":"Ruby","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/trizen.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2016-11-08T20:12:01.000Z","updated_at":"2026-02-24T14:05:45.000Z","dependencies_parsed_at":"2023-12-23T20:41:58.415Z","dependency_job_id":"9dc0da55-eccf-46dc-8fdd-90b3ad825dc3","html_url":"https://github.com/trizen/sidef-scripts","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"purl":"pkg:github/trizen/sidef-scripts","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/trizen%2Fsidef-scripts","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/trizen%2Fsidef-scripts/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/trizen%2Fsidef-scripts/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/trizen%2Fsidef-scripts/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/trizen","download_url":"https://codeload.github.com/trizen/sidef-scripts/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/trizen%2Fsidef-scripts/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30326878,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-10T05:25:20.737Z","status":"ssl_error","status_checked_at":"2026-03-10T05:25:17.430Z","response_time":106,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["math","scripts","sidef","sidef-scripts","utils"],"created_at":"2024-11-14T00:12:29.072Z","updated_at":"2026-03-10T06:03:39.987Z","avatar_url":"https://github.com/trizen.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"sidef-scripts\n=============\n\nA nice collection of day-to-day Sidef scripts.\n\n### Summary\n\n* Blockchain\n    * [Blockchain](./Blockchain/Blockchain.sm)\n    * [Main](./Blockchain/main.sf)\n    * [SigningKey](./Blockchain/SigningKey.sm)\n* Compression\n    * [Bwrl file compression](./Compression/bwrl_file_compression.sf)\n    * [Bwt file compression](./Compression/bwt_file_compression.sf)\n    * [Bzip2 compressor](./Compression/bzip2_compressor.sf)\n    * [Bzip2 decompressor](./Compression/bzip2_decompressor.sf)\n    * [Compress](./Compression/compress.sf)\n    * [Gzip compressor](./Compression/gzip_compressor.sf)\n    * [Gzip decompressor](./Compression/gzip_decompressor.sf)\n    * [Huffman file compression](./Compression/huffman_file_compression.sf)\n    * [Lz4 decompressor](./Compression/lz4_decompressor.sf)\n    * [Lz77 file compression](./Compression/lz77_file_compression.sf)\n    * [Lzh file compression](./Compression/lzh_file_compression.sf)\n    * [Lzih file compression](./Compression/lzih_file_compression.sf)\n    * [Lzw file compression](./Compression/lzw_file_compression.sf)\n    * [Lzw file compression utf8](./Compression/lzw_file_compression_utf8.sf)\n* Converters\n    * [Any2audio](./Converters/any2audio.sf)\n    * [Any2mp3](./Converters/any2mp3.sf)\n    * [Extract audio](./Converters/extract_audio.sf)\n* Decoding\n    * [Base64 decoder](./Decoding/base64_decoder.sf)\n    * [Cnp](./Decoding/cnp.sf)\n* Digest\n    * [Binomial hash function](./Digest/binomial_hash_function.sf)\n    * [Crc32](./Digest/crc32.sf)\n    * [Md5](./Digest/md5.sf)\n* Encoding\n    * [Adaptive huffman coding](./Encoding/adaptive_huffman_coding.sf)\n    * [Adaptive huffman coding with escape symbols](./Encoding/adaptive_huffman_coding_with_escape_symbols.sf)\n    * [Adaptive huffman coding with escape symbols 2](./Encoding/adaptive_huffman_coding_with_escape_symbols_2.sf)\n    * [Arithmetic coding](./Encoding/arithmetic_coding.sf)\n    * [Arithmetic coding in fixed bits](./Encoding/arithmetic_coding_in_fixed_bits.sf)\n    * [Arithmetic coding integer](./Encoding/arithmetic_coding_integer.sf)\n    * [Arithmetic coding rational](./Encoding/arithmetic_coding_rational.sf)\n    * [Binary variable length run encoding](./Encoding/binary_variable_length_run_encoding.sf)\n    * [Burrows-wheeler transform](./Encoding/burrows-wheeler_transform.sf)\n    * [Burrows-wheeler transform fast](./Encoding/burrows-wheeler_transform_fast.sf)\n    * [Burrows-wheeler transform linear](./Encoding/burrows-wheeler_transform_linear.sf)\n    * [Burrows-wheeler transform symbolic](./Encoding/burrows-wheeler_transform_symbolic.sf)\n    * [Caesar cipher](./Encoding/caesar_cipher.sf)\n    * [Delta encoding with double-elias coding](./Encoding/delta_encoding_with_double-elias_coding.sf)\n    * [Delta encoding with elias coding](./Encoding/delta_encoding_with_elias_coding.sf)\n    * [Delta encoding with unary coding](./Encoding/delta_encoding_with_unary_coding.sf)\n    * [Delta rle elias encoding](./Encoding/delta_rle_elias_encoding.sf)\n    * [Huffman coding](./Encoding/huffman_coding.sf)\n    * [Huffman prime encoding](./Encoding/huffman_prime_encoding.sf)\n    * [Integers binary encoding](./Encoding/integers_binary_encoding.sf)\n    * [Log encode](./Encoding/log_encode.sf)\n    * [Lz77 compression](./Encoding/lz77_compression.sf)\n    * [Lzss encoding hash table](./Encoding/lzss_encoding_hash_table.sf)\n    * [Lzss encoding hash table fast](./Encoding/lzss_encoding_hash_table_fast.sf)\n    * [Lzw compression](./Encoding/lzw_compression.sf)\n    * [Move-to-front transform](./Encoding/move-to-front_transform.sf)\n    * [Ppm encoding](./Encoding/ppm_encoding.sf)\n    * [Ppm encoding dynamic](./Encoding/ppm_encoding_dynamic.sf)\n    * [RANS encoding](./Encoding/rANS_encoding.sf)\n    * [Run length encoding](./Encoding/run_length_encoding.sf)\n    * [Run length with elias coding](./Encoding/run_length_with_elias_coding.sf)\n    * [Substitution cipher](./Encoding/substitution_cipher.sf)\n    * [Variable length run encoding](./Encoding/variable_length_run_encoding.sf)\n    * [Variable length run encoding 2](./Encoding/variable_length_run_encoding_2.sf)\n    * [Vinegere cipher](./Encoding/vinegere_cipher.sf)\n* Encryption\n    * [Age-lf](./Encryption/age-lf.sf)\n    * [Backdoored rsa with x25519](./Encryption/backdoored_rsa_with_x25519.sf)\n    * [Insecurity of XOR](./Encryption/insecurity_of_XOR.sf)\n    * [Multiplication encryption](./Encryption/multiplication_encryption.sf)\n    * [One-time pad](./Encryption/one-time_pad.sf)\n* File\n    * [Fdf](./File/fdf.sf)\n    * [File difference](./File/file_difference.sf)\n    * [File exclusive union](./File/file_exclusive_union.sf)\n    * [File intersection](./File/file_intersection.sf)\n    * [Make filenames safe](./File/make_filenames_safe.sf)\n* Game solvers\n    * [Asciiplanes-player](./Game%20solvers/asciiplanes-player.sf)\n    * [Chess960 initial positions](./Game%20solvers/chess960_initial_positions.sf)\n    * [Sudoku generator](./Game%20solvers/sudoku_generator.sf)\n    * [Sudoku solver](./Game%20solvers/sudoku_solver.sf)\n    * [Sudoku solver backtracking](./Game%20solvers/sudoku_solver_backtracking.sf)\n    * [Sudoku solver iterative](./Game%20solvers/sudoku_solver_iterative.sf)\n    * [Sudoku solver stack](./Game%20solvers/sudoku_solver_stack.sf)\n* Games\n    * [Asciiplanes](./Games/asciiplanes.sf)\n    * [Bulls and cows](./Games/bulls_and_cows.sf)\n    * [Bulls and cows player](./Games/bulls_and_cows_player.sf)\n    * [Conway's game of life](./Games/conway_s_game_of_life.sf)\n    * [Crack the code](./Games/crack_the_code.sf)\n    * [Dice game solver](./Games/dice_game_solver.sf)\n    * [Forest fire](./Games/forest_fire.sf)\n    * [Forest fire oo](./Games/forest_fire_oo.sf)\n    * [Langton's ant](./Games/langton_s_ant.sf)\n    * [Maze generation](./Games/maze_generation.sf)\n    * [Rock-paper-scissors](./Games/rock-paper-scissors.sf)\n    * [Snake game](./Games/snake_game.sf)\n    * [Snake game oo](./Games/snake_game_oo.sf)\n* Genetic\n    * [Genetic algorithm](./Genetic/genetic_algorithm.sf)\n* Graph\n    * [Dijkstra's algorithm](./Graph/dijkstra_s_algorithm.sf)\n* GUI\n    * [Fbrowse tray](./GUI/fbrowse_tray.sf)\n* Image\n    * [Barnsley fern](./Image/barnsley_fern.sf)\n    * [Barnsley fern ifs](./Image/barnsley_fern_ifs.sf)\n    * [Chaos game](./Image/chaos_game.sf)\n    * [Circle from polygons](./Image/circle_from_polygons.sf)\n    * [Color wheel](./Image/color_wheel.sf)\n    * [Curlicue fractal](./Image/curlicue_fractal.sf)\n    * [Dragon curve](./Image/dragon_curve.sf)\n    * [Fractal tree](./Image/fractal_tree.sf)\n    * [Hilbert curve](./Image/hilbert_curve.sf)\n    * [Image difference](./Image/image_difference.sf)\n    * [Koch snowflake](./Image/koch_snowflake.sf)\n    * LSystem\n        * [LSystem](./Image/LSystem/LSystem.sf)\n        * [Turtle](./Image/LSystem/Turtle.sf)\n    * [Peano curve](./Image/peano_curve.sf)\n    * [Plant 1](./Image/plant_1.sf)\n    * [Plant 2](./Image/plant_2.sf)\n    * [Plasma effect](./Image/plasma_effect.sf)\n    * [Pythagoras tree](./Image/pythagoras_tree.sf)\n    * [Qoi decoder](./Image/qoi_decoder.sf)\n    * [Qoi decoder gd](./Image/qoi_decoder_gd.sf)\n    * [Qoi decoder magick](./Image/qoi_decoder_magick.sf)\n    * [Qoi encoder](./Image/qoi_encoder.sf)\n    * [Sierpinski arrowhead curve](./Image/sierpinski_arrowhead_curve.sf)\n    * [Sierpinski curve](./Image/sierpinski_curve.sf)\n    * [Sierpinski square curve](./Image/sierpinski_square_curve.sf)\n    * [Sierpinski triangle](./Image/sierpinski_triangle.sf)\n    * [Voronoi diagram](./Image/voronoi_diagram.sf)\n* Math\n    * [Achilles numbers](./Math/achilles_numbers.sf)\n    * [AGM calculate pi](./Math/AGM_calculate_pi.sf)\n    * [Aitken's array](./Math/aitken_s_array.sf)\n    * [Akiyama-tanigawa numerators](./Math/akiyama-tanigawa_numerators.sf)\n    * [Aks primality test](./Math/aks_primality_test.sf)\n    * [Aks primality test n-1 variant](./Math/aks_primality_test_n-1_variant.sf)\n    * [Almost divisors](./Math/almost_divisors.sf)\n    * [Almost prime divisors](./Math/almost_prime_divisors.sf)\n    * [Almost prime numbers](./Math/almost_prime_numbers.sf)\n    * [Almost prime numbers from factor set](./Math/almost_prime_numbers_from_factor_set.sf)\n    * [Almost prime numbers in range](./Math/almost_prime_numbers_in_range.sf)\n    * [Archimedes's cattle problem](./Math/archimedes_s_cattle_problem.sf)\n    * [Arithmetic-geometric-harmonic mean](./Math/arithmetic-geometric-harmonic_mean.sf)\n    * [Arithmetic-geometric mean](./Math/arithmetic-geometric_mean.sf)\n    * [Arithmetic-harmonic mean](./Math/arithmetic-harmonic_mean.sf)\n    * [Arithmetic convolution](./Math/arithmetic_convolution.sf)\n    * [Arithmetic derivative](./Math/arithmetic_derivative.sf)\n    * [Armstrong numbers](./Math/armstrong_numbers.sf)\n    * [Baillie-PSW high-level](./Math/Baillie-PSW_high-level.sf)\n    * [Batch gcd algorithm](./Math/batch_gcd_algorithm.sf)\n    * [BBP-type formulae](./Math/BBP-type_formulae.sf)\n    * [Bell numbers](./Math/bell_numbers.sf)\n    * [Bernoulli approx](./Math/bernoulli_approx.sf)\n    * [Bernoulli denominators](./Math/bernoulli_denominators.sf)\n    * [Bernoulli numbers from factorials](./Math/bernoulli_numbers_from_factorials.sf)\n    * [Bernoulli numbers from pascal triangle](./Math/bernoulli_numbers_from_pascal_triangle.sf)\n    * [Bernoulli numbers from pascal triangle 2](./Math/bernoulli_numbers_from_pascal_triangle_2.sf)\n    * [Bernoulli numbers from pascal triangle 3](./Math/bernoulli_numbers_from_pascal_triangle_3.sf)\n    * [Bernoulli numbers from primes](./Math/bernoulli_numbers_from_primes.sf)\n    * [Bernoulli numbers from zeta](./Math/bernoulli_numbers_from_zeta.sf)\n    * [Bernoulli numbers new recurrence](./Math/bernoulli_numbers_new_recurrence.sf)\n    * [Bernoulli numbers new recurrence 2](./Math/bernoulli_numbers_new_recurrence_2.sf)\n    * [Bernoulli numbers numberphile](./Math/bernoulli_numbers_numberphile.sf)\n    * [Bernoulli numbers ramanujan congruences](./Math/bernoulli_numbers_ramanujan_congruences.sf)\n    * [Bernoulli numbers recurrence](./Math/bernoulli_numbers_recurrence.sf)\n    * [Bernoulli numbers recurrence 2](./Math/bernoulli_numbers_recurrence_2.sf)\n    * [Bernoulli numbers seidel](./Math/bernoulli_numbers_seidel.sf)\n    * [Bi-unitary divisors](./Math/bi-unitary_divisors.sf)\n    * [Bi-unitary sigma](./Math/bi-unitary_sigma.sf)\n    * [Bi-unitary totient](./Math/bi-unitary_totient.sf)\n    * [Binary exponentiation](./Math/binary_exponentiation.sf)\n    * [Binary gcd algorithm](./Math/binary_gcd_algorithm.sf)\n    * [Binomial real](./Math/binomial_real.sf)\n    * [Binomial theorem](./Math/binomial_theorem.sf)\n    * [Binomial transform](./Math/binomial_transform.sf)\n    * [Bisected hypotenuse](./Math/bisected_hypotenuse.sf)\n    * [Blandin-diaz compositional bernoulli numbers B S 1](./Math/blandin-diaz_compositional_bernoulli_numbers_B_S_1.sf)\n    * [Blandin-diaz compositional bernoulli numbers B S 1 2](./Math/blandin-diaz_compositional_bernoulli_numbers_B_S_1_2.sf)\n    * [Blandin-diaz compositional bernoulli numbers B Z 1](./Math/blandin-diaz_compositional_bernoulli_numbers_B_Z_1.sf)\n    * [Blandin-diaz compositional bernoulli numbers B Z 1 2](./Math/blandin-diaz_compositional_bernoulli_numbers_B_Z_1_2.sf)\n    * [Both truncatable primes in base](./Math/both_truncatable_primes_in_base.sf)\n    * [BPSW primality test](./Math/BPSW_primality_test.sf)\n    * [Brilliant numbers count](./Math/brilliant_numbers_count.sf)\n    * [Carmichael factorization method](./Math/carmichael_factorization_method.sf)\n    * [Carmichael factorization method generalized](./Math/carmichael_factorization_method_generalized.sf)\n    * [Carmichael generation erdos method](./Math/carmichael_generation_erdos_method.sf)\n    * [Carmichael generation erdos method dynamic programming](./Math/carmichael_generation_erdos_method_dynamic_programming.sf)\n    * [Carmichael numbers in range](./Math/carmichael_numbers_in_range.sf)\n    * [Carmichael numbers upto](./Math/carmichael_numbers_upto.sf)\n    * [Carmichael strong fermat pseudoprimes in range](./Math/carmichael_strong_fermat_pseudoprimes_in_range.sf)\n    * [Cartesian product](./Math/cartesian_product.sf)\n    * [Cauchy numbers of first type recurrence](./Math/cauchy_numbers_of_first_type_recurrence.sf)\n    * [Central trinomial triangle](./Math/central_trinomial_triangle.sf)\n    * [Champernowne constant nth digit](./Math/champernowne_constant_nth_digit.sf)\n    * [Chebyshev factorization method](./Math/chebyshev_factorization_method.sf)\n    * [Chernick-carmichael numbers](./Math/chernick-carmichael_numbers.sf)\n    * [Chernick-carmichael with n factors sieve](./Math/chernick-carmichael_with_n_factors_sieve.sf)\n    * [Chinese factorization method](./Math/chinese_factorization_method.sf)\n    * [Chinese factorization method 2](./Math/chinese_factorization_method_2.sf)\n    * [Chinese modular exponentiation](./Math/chinese_modular_exponentiation.sf)\n    * [Chinese prime signature](./Math/chinese_prime_signature.sf)\n    * [Chinese remainder theorem](./Math/chinese_remainder_theorem.sf)\n    * [Chinese signature](./Math/chinese_signature.sf)\n    * [Cipolla algorithm](./Math/cipolla_algorithm.sf)\n    * [Cipolla algorithm simple](./Math/cipolla_algorithm_simple.sf)\n    * [Cipolla modular square root](./Math/cipolla_modular_square_root.sf)\n    * [Coin change](./Math/coin_change.sf)\n    * [Complex modular exponentiation](./Math/complex_modular_exponentiation.sf)\n    * [Complex modular multiplicative inverse](./Math/complex_modular_multiplicative_inverse.sf)\n    * [Complex modular multiplicative inverse 2](./Math/complex_modular_multiplicative_inverse_2.sf)\n    * [Complex zeta function representations](./Math/complex_zeta_function_representations.sf)\n    * [Conditional euler totient function](./Math/conditional_euler_totient_function.sf)\n    * [Confluent hypergeometric function of the first kind](./Math/confluent_hypergeometric_function_of_the_first_kind.sf)\n    * [Congruence of powers factorization method](./Math/congruence_of_powers_factorization_method.sf)\n    * [Congruence solution inverse of x minus n mod x equals n](./Math/congruence_solution_inverse_of_x_minus_n_mod_x_equals_n.sf)\n    * [Congruence solution inverse of x plus n mod x equals n](./Math/congruence_solution_inverse_of_x_plus_n_mod_x_equals_n.sf)\n    * [Consecutive partitions](./Math/consecutive_partitions.sf)\n    * [Constant-recursive factorization method](./Math/constant-recursive_factorization_method.sf)\n    * [Constant e to n decimal places](./Math/constant_e_to_n_decimal_places.sf)\n    * [Continued fraction](./Math/continued_fraction.sf)\n    * [Continued fraction factorization method](./Math/continued_fraction_factorization_method.sf)\n    * [Continued fraction factorization method simple](./Math/continued_fraction_factorization_method_simple.sf)\n    * [Continued fraction to fraction](./Math/continued_fraction_to_fraction.sf)\n    * [Continued fractions convergents](./Math/continued_fractions_convergents.sf)\n    * [Continued fractions convergents fast](./Math/continued_fractions_convergents_fast.sf)\n    * [Continued fractions for nth roots](./Math/continued_fractions_for_nth_roots.sf)\n    * [Convergents to cube root of 2](./Math/convergents_to_cube_root_of_2.sf)\n    * [Count of composite numbers](./Math/count_of_composite_numbers.sf)\n    * [Count of cube-full numbers](./Math/count_of_cube-full_numbers.sf)\n    * [Count of integers with gpf of n equals p](./Math/count_of_integers_with_gpf_of_n_equals_p.sf)\n    * [Count of integers with lpf of n equals p](./Math/count_of_integers_with_lpf_of_n_equals_p.sf)\n    * [Count of k-almost primes](./Math/count_of_k-almost_primes.sf)\n    * [Count of k-almost primes in range](./Math/count_of_k-almost_primes_in_range.sf)\n    * [Count of k-omega primes](./Math/count_of_k-omega_primes.sf)\n    * [Count of k-powerfree numbers](./Math/count_of_k-powerfree_numbers.sf)\n    * [Count of k-powerful numbers](./Math/count_of_k-powerful_numbers.sf)\n    * [Count of k-powerful numbers in range](./Math/count_of_k-powerful_numbers_in_range.sf)\n    * [Count of palindromic numbers](./Math/count_of_palindromic_numbers.sf)\n    * [Count of perfect powers](./Math/count_of_perfect_powers.sf)\n    * [Count of primes](./Math/count_of_primes.sf)\n    * [Count of pythagorean triples with side n](./Math/count_of_pythagorean_triples_with_side_n.sf)\n    * [Count of rough numbers](./Math/count_of_rough_numbers.sf)\n    * [Count of rough numbers double recursive](./Math/count_of_rough_numbers_double_recursive.sf)\n    * [Count of rough numbers recursive](./Math/count_of_rough_numbers_recursive.sf)\n    * [Count of smooth numbers](./Math/count_of_smooth_numbers.sf)\n    * [Count of smooth numbers 2](./Math/count_of_smooth_numbers_2.sf)\n    * [Count of square-full numbers](./Math/count_of_square-full_numbers.sf)\n    * [Count of squarefree k-almost primes](./Math/count_of_squarefree_k-almost_primes.sf)\n    * [Count of squarefree numbers](./Math/count_of_squarefree_numbers.sf)\n    * [Cousin mersenne primes lucas-lehmer](./Math/cousin_mersenne_primes_lucas-lehmer.sf)\n    * [CRT polynomial multiplication](./Math/CRT_polynomial_multiplication.sf)\n    * [Cuban primes](./Math/cuban_primes.sf)\n    * [Cube-full numbers](./Math/cube-full_numbers.sf)\n    * [Cyclops numbers](./Math/cyclops_numbers.sf)\n    * [Cyclotomic factorization method](./Math/cyclotomic_factorization_method.sf)\n    * [Cyclotomic polynomial](./Math/cyclotomic_polynomial.sf)\n    * [Cyclotomic polynomials expansion](./Math/cyclotomic_polynomials_expansion.sf)\n    * [Cyclotomic polynomials expansion native](./Math/cyclotomic_polynomials_expansion_native.sf)\n    * [Derivative numerical approximation](./Math/derivative_numerical_approximation.sf)\n    * [Dickson linear forms prime sieve](./Math/dickson_linear_forms_prime_sieve.sf)\n    * [Dickson linear forms prime sieve in range](./Math/dickson_linear_forms_prime_sieve_in_range.sf)\n    * [Dickson linear forms prime sieve in range 2](./Math/dickson_linear_forms_prime_sieve_in_range_2.sf)\n    * [Dickson linear forms prime sieve in range 3](./Math/dickson_linear_forms_prime_sieve_in_range_3.sf)\n    * [Difference of matrices factorization method](./Math/difference_of_matrices_factorization_method.sf)\n    * [Difference of powers factorization method](./Math/difference_of_powers_factorization_method.sf)\n    * [Difference of two rectangles solutions](./Math/difference_of_two_rectangles_solutions.sf)\n    * [Difference of two squares solutions](./Math/difference_of_two_squares_solutions.sf)\n    * [Digamma function](./Math/digamma_function.sf)\n    * [Digit-segmentation square root representation](./Math/digit-segmentation_square_root_representation.sf)\n    * [Digit-sum numbers](./Math/digit-sum_numbers.sf)\n    * [Digits to number subquadratic algorithms](./Math/digits_to_number_subquadratic_algorithms.sf)\n    * [Dirichlet convolution](./Math/dirichlet_convolution.sf)\n    * [Dirichlet hyperbola method](./Math/dirichlet_hyperbola_method.sf)\n    * [Discrete fourier transform](./Math/discrete_fourier_transform.sf)\n    * [Discrete logarithm pollard rho](./Math/discrete_logarithm_pollard_rho.sf)\n    * [Divisor of p-1 factorization method](./Math/divisor_of_p-1_factorization_method.sf)\n    * [Divisors less than k](./Math/divisors_less_than_k.sf)\n    * [Divisors of factorial in range iterator](./Math/divisors_of_factorial_in_range_iterator.sf)\n    * [Double summation formula](./Math/double_summation_formula.sf)\n    * [Draw grid of squares](./Math/draw_grid_of_squares.sf)\n    * [Eisenstein integers](./Math/eisenstein_integers.sf)\n    * [Elementary cellular automaton](./Math/elementary_cellular_automaton.sf)\n    * [Elementary cellular automaton generalized](./Math/elementary_cellular_automaton_generalized.sf)\n    * [Elliptic-curve factorization method](./Math/elliptic-curve_factorization_method.sf)\n    * [Elliptic-curve factorization method with B2 stage](./Math/elliptic-curve_factorization_method_with_B2_stage.sf)\n    * [Equally spaced squares solutions](./Math/equally_spaced_squares_solutions.sf)\n    * [Esthetic numbers](./Math/esthetic_numbers.sf)\n    * [Euler-maclaurin formula](./Math/euler-maclaurin_formula.sf)\n    * [Euler numbers from factorials](./Math/euler_numbers_from_factorials.sf)\n    * [Euler's totient theorem expmod](./Math/euler_s_totient_theorem_expmod.sf)\n    * [Exact division](./Math/exact_division.sf)\n    * [Exact division 2](./Math/exact_division_2.sf)\n    * [Exponential divisors](./Math/exponential_divisors.sf)\n    * [Exponential inverse](./Math/exponential_inverse.sf)\n    * [Exponential sigma](./Math/exponential_sigma.sf)\n    * [Extended greatest common divisor](./Math/extended_greatest_common_divisor.sf)\n    * [Factorial approximation bernoulli](./Math/factorial_approximation_bernoulli.sf)\n    * [Factorial approximation from incomplete gamma](./Math/factorial_approximation_from_incomplete_gamma.sf)\n    * [Factorial approximations](./Math/factorial_approximations.sf)\n    * [Factorial dsc algorithm](./Math/factorial_dsc_algorithm.sf)\n    * [Factorial expansion](./Math/factorial_expansion.sf)\n    * [Factorial valuation generalized](./Math/factorial_valuation_generalized.sf)\n    * [Factorization of fibonacci numbers](./Math/factorization_of_fibonacci_numbers.sf)\n    * [Farey factorization method](./Math/farey_factorization_method.sf)\n    * [Farey fraction approximations](./Math/farey_fraction_approximations.sf)\n    * [Farey fraction approximations 2](./Math/farey_fraction_approximations_2.sf)\n    * [Farey sequences](./Math/farey_sequences.sf)\n    * [Fast fourier transform](./Math/fast_fourier_transform.sf)\n    * [Faulhaber double series](./Math/faulhaber_double_series.sf)\n    * [Faulhaber root](./Math/faulhaber_root.sf)\n    * [Faulhaber's formula](./Math/faulhaber_s_formula.sf)\n    * [Faulhaber's polynomials](./Math/faulhaber_s_polynomials.sf)\n    * [Faulhaber's triangle](./Math/faulhaber_s_triangle.sf)\n    * [Faulhaber's triangle polynomial interpolation](./Math/faulhaber_s_triangle_polynomial_interpolation.sf)\n    * [Fermat factorization improved](./Math/fermat_factorization_improved.sf)\n    * [Fermat factorization method](./Math/fermat_factorization_method.sf)\n    * [Fermat factorization method 2](./Math/fermat_factorization_method_2.sf)\n    * [Fermat hybrid factorization method](./Math/fermat_hybrid_factorization_method.sf)\n    * [Fermat numbers find small factor](./Math/fermat_numbers_find_small_factor.sf)\n    * [Fermat overpseudoprimes generation](./Math/fermat_overpseudoprimes_generation.sf)\n    * [Fermat overpseudoprimes in range](./Math/fermat_overpseudoprimes_in_range.sf)\n    * [Fermat pseudoprimes generation](./Math/fermat_pseudoprimes_generation.sf)\n    * [Fermat pseudoprimes generation 2](./Math/fermat_pseudoprimes_generation_2.sf)\n    * [Fermat pseudoprimes generation 3](./Math/fermat_pseudoprimes_generation_3.sf)\n    * [Fermat pseudoprimes in range](./Math/fermat_pseudoprimes_in_range.sf)\n    * [Fermat strong primality test](./Math/fermat_strong_primality_test.sf)\n    * [Fermat superpseudoprimes generation](./Math/fermat_superpseudoprimes_generation.sf)\n    * [Fibonacci-fermat primality test](./Math/fibonacci-fermat_primality_test.sf)\n    * [Fibonacci closed solution](./Math/fibonacci_closed_solution.sf)\n    * [Fibonacci encoding](./Math/fibonacci_encoding.sf)\n    * [Fibonacci factorization method](./Math/fibonacci_factorization_method.sf)\n    * [Fibonacci first and last k digits](./Math/fibonacci_first_and_last_k_digits.sf)\n    * [Fibonacci first k digits in base b](./Math/fibonacci_first_k_digits_in_base_b.sf)\n    * [Fibonacci k-th order](./Math/fibonacci_k-th_order.sf)\n    * [Fibonacci k-th order 2](./Math/fibonacci_k-th_order_2.sf)\n    * [Fibonacci k-th order efficient algorithm](./Math/fibonacci_k-th_order_efficient_algorithm.sf)\n    * [Fibonacci k-th order period](./Math/fibonacci_k-th_order_period.sf)\n    * [Fibonacci number divisible by n](./Math/fibonacci_number_divisible_by_n.sf)\n    * [Fibonacci number fast](./Math/fibonacci_number_fast.sf)\n    * [Fibonacci polynomial numbers](./Math/fibonacci_polynomial_numbers.sf)\n    * [Fibonacci pseudoprimes from twin primes](./Math/fibonacci_pseudoprimes_from_twin_primes.sf)\n    * [Fibonacci word fractal](./Math/fibonacci_word_fractal.sf)\n    * [Flt factorization method](./Math/flt_factorization_method.sf)\n    * [Fraction approximation](./Math/fraction_approximation.sf)\n    * [Frobenius primality test](./Math/frobenius_primality_test.sf)\n    * [Frobenius primality test polynomial](./Math/frobenius_primality_test_polynomial.sf)\n    * [Frobenius pseudoprimes generation](./Math/frobenius_pseudoprimes_generation.sf)\n    * [Fubini numbers](./Math/fubini_numbers.sf)\n    * [Function inverse binary search](./Math/function_inverse_binary_search.sf)\n    * [Function inverse mediant inequality](./Math/function_inverse_mediant_inequality.sf)\n    * [Fusc function](./Math/fusc_function.sf)\n    * [Gamma function](./Math/gamma_function.sf)\n    * [Gauss logarithm approx](./Math/gauss_logarithm_approx.sf)\n    * [Gaussian divisors](./Math/gaussian_divisors.sf)\n    * [Gaussian elimination GF2 matrix](./Math/gaussian_elimination_GF2_matrix.sf)\n    * [Gaussian factors](./Math/gaussian_factors.sf)\n    * [Gaussian integers](./Math/gaussian_integers.sf)\n    * [Gaussian representations](./Math/gaussian_representations.sf)\n    * [Generalized bernoulli numbers](./Math/generalized_bernoulli_numbers.sf)\n    * [Generalized continued fraction](./Math/generalized_continued_fraction.sf)\n    * [Generalized continued fraction parts iter](./Math/generalized_continued_fraction_parts_iter.sf)\n    * [Generalized expansion](./Math/generalized_expansion.sf)\n    * [Generalized fibonacci closed-form](./Math/generalized_fibonacci_closed-form.sf)\n    * [Generalized fibonacci closed-form 2](./Math/generalized_fibonacci_closed-form_2.sf)\n    * [Generalized fibonacci closed-form 3](./Math/generalized_fibonacci_closed-form_3.sf)\n    * [Generalized lucas closed-form](./Math/generalized_lucas_closed-form.sf)\n    * [Generalized mean](./Math/generalized_mean.sf)\n    * [Generalized partial sums of sigma function](./Math/generalized_partial_sums_of_sigma_function.sf)\n    * [Generate k-rough numbers](./Math/generate_k-rough_numbers.sf)\n    * [Generate numbers with given edges](./Math/generate_numbers_with_given_edges.sf)\n    * [Generate numbers with given subdigits](./Math/generate_numbers_with_given_subdigits.sf)\n    * [Generate primes with a given digit sum](./Math/generate_primes_with_a_given_digit_sum.sf)\n    * [Generate primes with digits in ascending order](./Math/generate_primes_with_digits_in_ascending_order.sf)\n    * [Generate primes with digits in descending order](./Math/generate_primes_with_digits_in_descending_order.sf)\n    * [Generate primes with digits in nondecreasing order](./Math/generate_primes_with_digits_in_nondecreasing_order.sf)\n    * [Generate primes with only one odd digit](./Math/generate_primes_with_only_one_odd_digit.sf)\n    * [Generate primes with prime digits](./Math/generate_primes_with_prime_digits.sf)\n    * [Geometric-harmonic mean](./Math/geometric-harmonic_mean.sf)\n    * [Greatest common unitary divisor](./Math/greatest_common_unitary_divisor.sf)\n    * [Greedy egyptian fractions](./Math/greedy_egyptian_fractions.sf)\n    * [Gregory coefficients](./Math/gregory_coefficients.sf)\n    * [Hamming numbers](./Math/hamming_numbers.sf)\n    * [Harmonic numbers closed form](./Math/harmonic_numbers_closed_form.sf)\n    * [Harmonic numbers from powers](./Math/harmonic_numbers_from_powers.sf)\n    * [Harmonic numbers from powers simple](./Math/harmonic_numbers_from_powers_simple.sf)\n    * [Harmonic numbers of k-th order](./Math/harmonic_numbers_of_k-th_order.sf)\n    * [Harmonic prime powers](./Math/harmonic_prime_powers.sf)\n    * [Haversine formula](./Math/haversine_formula.sf)\n    * [Highly composite numbers](./Math/highly_composite_numbers.sf)\n    * [Holf-pell factorization](./Math/holf-pell_factorization.sf)\n    * [Holf factorization](./Math/holf_factorization.sf)\n    * [Home primes](./Math/home_primes.sf)\n    * [Infinitary divisors](./Math/infinitary_divisors.sf)\n    * [Infinitary sigma](./Math/infinitary_sigma.sf)\n    * [Infinitary totient](./Math/infinitary_totient.sf)\n    * [Integer root](./Math/integer_root.sf)\n    * [Integer root binary search](./Math/integer_root_binary_search.sf)\n    * [Integer square root](./Math/integer_square_root.sf)\n    * [Inverse of bernoulli numbers](./Math/inverse_of_bernoulli_numbers.sf)\n    * [Inverse of euler totient](./Math/inverse_of_euler_totient.sf)\n    * [Inverse of factorial](./Math/inverse_of_factorial.sf)\n    * [Inverse of factorial stirling](./Math/inverse_of_factorial_stirling.sf)\n    * [Inverse of factorial validation](./Math/inverse_of_factorial_validation.sf)\n    * [Inverse of fibonacci](./Math/inverse_of_fibonacci.sf)\n    * [Inverse of multiplicative functions](./Math/inverse_of_multiplicative_functions.sf)\n    * [Inverse of sigma function](./Math/inverse_of_sigma_function.sf)\n    * [Inverse of uphi function](./Math/inverse_of_uphi_function.sf)\n    * [Inverse of usigma function](./Math/inverse_of_usigma_function.sf)\n    * [Inverse znorder](./Math/inverse_znorder.sf)\n    * [Invmod of coprime factorials](./Math/invmod_of_coprime_factorials.sf)\n    * [Irregular triangle of n AND k](./Math/irregular_triangle_of_n_AND_k.sf)\n    * [Is almost prime](./Math/is_almost_prime.sf)\n    * [Is bfsw pseudoprime](./Math/is_bfsw_pseudoprime.sf)\n    * [Is both truncatable prime](./Math/is_both_truncatable_prime.sf)\n    * [Is carmichael number](./Math/is_carmichael_number.sf)\n    * [Is even perfect](./Math/is_even_perfect.sf)\n    * [Is even perfect 2](./Math/is_even_perfect_2.sf)\n    * [Is extra bfsw pseudoprime](./Math/is_extra_bfsw_pseudoprime.sf)\n    * [Is infinitary divisor](./Math/is_infinitary_divisor.sf)\n    * [Is lucas-carmichael number](./Math/is_lucas-carmichael_number.sf)\n    * [Is omega prime](./Math/is_omega_prime.sf)\n    * [Is perfect power](./Math/is_perfect_power.sf)\n    * [Is perfect power fast](./Math/is_perfect_power_fast.sf)\n    * [Is practical number](./Math/is_practical_number.sf)\n    * [Is prob squarefree](./Math/is_prob_squarefree.sf)\n    * [Is smooth over product](./Math/is_smooth_over_product.sf)\n    * [Is squarefree over product](./Math/is_squarefree_over_product.sf)\n    * [Jacobi symbol](./Math/jacobi_symbol.sf)\n    * [Jordan polya numbers](./Math/jordan_polya_numbers.sf)\n    * [Julia set](./Math/julia_set.sf)\n    * [K-imperfect numbers](./Math/k-imperfect_numbers.sf)\n    * [K-non-powerfree numbers in range](./Math/k-non-powerfree_numbers_in_range.sf)\n    * [K-odd-powerful numbers in range](./Math/k-odd-powerful_numbers_in_range.sf)\n    * [K-powerful numbers](./Math/k-powerful_numbers.sf)\n    * [K-powerful numbers in range](./Math/k-powerful_numbers_in_range.sf)\n    * [Karatsuba multiplication](./Math/karatsuba_multiplication.sf)\n    * [Kempner binomial numbers](./Math/kempner_binomial_numbers.sf)\n    * [Knapsack problem 0 1](./Math/knapsack_problem_0_1.sf)\n    * [Knapsack problem bounded](./Math/knapsack_problem_bounded.sf)\n    * [Knapsack problem unbounded](./Math/knapsack_problem_unbounded.sf)\n    * [Kosaraju's algorithm](./Math/kosaraju_s_algorithm.sf)\n    * [Krzysztof reformulated zeta function](./Math/krzysztof_reformulated_zeta_function.sf)\n    * [Laguerre polynomials](./Math/laguerre_polynomials.sf)\n    * [LambertW function](./Math/LambertW_function.sf)\n    * [Lanczos approximation](./Math/lanczos_approximation.sf)\n    * [Largest factorial less than 10 to the 10 to the n](./Math/largest_factorial_less_than_10_to_the_10_to_the_n.sf)\n    * [Largest palindrome product](./Math/largest_palindrome_product.sf)\n    * [Least prime factor sieve](./Math/least_prime_factor_sieve.sf)\n    * [Left-right truncatable primes](./Math/left-right_truncatable_primes.sf)\n    * [Left truncatable primes](./Math/left_truncatable_primes.sf)\n    * [Left truncatable primes in base](./Math/left_truncatable_primes_in_base.sf)\n    * [Legendary question six](./Math/legendary_question_six.sf)\n    * [Legendre factorial](./Math/legendre_factorial.sf)\n    * [Legendre prime counting function](./Math/legendre_prime_counting_function.sf)\n    * [Legendre prime counting function from k-rough count](./Math/legendre_prime_counting_function_from_k-rough_count.sf)\n    * [Lehman factorization](./Math/lehman_factorization.sf)\n    * [Levenshtein distance iter](./Math/levenshtein_distance_iter.sf)\n    * [Levenshtein distance rec](./Math/levenshtein_distance_rec.sf)\n    * [Limits for pi](./Math/limits_for_pi.sf)\n    * [Linear congruential generator](./Math/linear_congruential_generator.sf)\n    * [Linear diophantine equation](./Math/linear_diophantine_equation.sf)\n    * [Linear diophantine equation invmod search](./Math/linear_diophantine_equation_invmod_search.sf)\n    * [Linear recurrence matrix form](./Math/linear_recurrence_matrix_form.sf)\n    * [Linked list addition](./Math/linked_list_addition.sf)\n    * [Liouville almost prime count](./Math/liouville_almost_prime_count.sf)\n    * [Liouville sum function](./Math/liouville_sum_function.sf)\n    * [Log10 digit by digit](./Math/log10_digit_by_digit.sf)\n    * [Long addition](./Math/long_addition.sf)\n    * [Long multiplication](./Math/long_multiplication.sf)\n    * [Lu decomposition](./Math/lu_decomposition.sf)\n    * [Lucas-carmichael generation erdos method](./Math/lucas-carmichael_generation_erdos_method.sf)\n    * [Lucas-carmichael numbers in range](./Math/lucas-carmichael_numbers_in_range.sf)\n    * [Lucas-carmichael numbers upto](./Math/lucas-carmichael_numbers_upto.sf)\n    * [Lucas-lehmer primality test](./Math/lucas-lehmer_primality_test.sf)\n    * [Lucas-miller factorization method](./Math/lucas-miller_factorization_method.sf)\n    * [Lucas-pocklington primality proving](./Math/lucas-pocklington_primality_proving.sf)\n    * [Lucas-pratt primality proving](./Math/lucas-pratt_primality_proving.sf)\n    * [Lucas factorization method](./Math/lucas_factorization_method.sf)\n    * [Lucas factorization method generalized](./Math/lucas_factorization_method_generalized.sf)\n    * [Lucas flt factorization method](./Math/lucas_flt_factorization_method.sf)\n    * [Lucas primality test](./Math/lucas_primality_test.sf)\n    * [Lucas pseudoprimes generation](./Math/lucas_pseudoprimes_generation.sf)\n    * [Lucas pseudoprimes generation erdos method](./Math/lucas_pseudoprimes_generation_erdos_method.sf)\n    * [Lucas restricted domain primality test](./Math/lucas_restricted_domain_primality_test.sf)\n    * [Lucas sequences of k-th order](./Math/lucas_sequences_of_k-th_order.sf)\n    * [Lucas sequences U V](./Math/lucas_sequences_U_V.sf)\n    * [Lucas theorem](./Math/lucas_theorem.sf)\n    * [Lucas V pseudoprime test](./Math/lucas_V_pseudoprime_test.sf)\n    * [LUP decomposition](./Math/LUP_decomposition.sf)\n    * [Mandelbrot set](./Math/mandelbrot_set.sf)\n    * [Mathematical formulas](./Math/mathematical_formulas.sf)\n    * [MBE factorization method](./Math/MBE_factorization_method.sf)\n    * [Meissel lehmer prime count](./Math/meissel_lehmer_prime_count.sf)\n    * [Mertens function](./Math/mertens_function.sf)\n    * [Miller-rabin factorization method](./Math/miller-rabin_factorization_method.sf)\n    * [Miller-rabin primality test](./Math/miller-rabin_primality_test.sf)\n    * [Mills constant](./Math/mills_constant.sf)\n    * [Modular bell numbers recurrence](./Math/modular_bell_numbers_recurrence.sf)\n    * [Modular bernoulli numbers numberphile](./Math/modular_bernoulli_numbers_numberphile.sf)\n    * [Modular binomial fast](./Math/modular_binomial_fast.sf)\n    * [Modular cyclotomic polynomial](./Math/modular_cyclotomic_polynomial.sf)\n    * [Modular elliptic-curve arithmetic](./Math/modular_elliptic-curve_arithmetic.sf)\n    * [Modular exponentiation](./Math/modular_exponentiation.sf)\n    * [Modular fibonacci number cassini](./Math/modular_fibonacci_number_cassini.sf)\n    * [Modular fibonacci number fast](./Math/modular_fibonacci_number_fast.sf)\n    * [Modular hyperoperation](./Math/modular_hyperoperation.sf)\n    * [Modular k-th root all solutions fast](./Math/modular_k-th_root_all_solutions_fast.sf)\n    * [Modular k-th root all solutions znlog](./Math/modular_k-th_root_all_solutions_znlog.sf)\n    * [Modular lucas sequence V](./Math/modular_lucas_sequence_V.sf)\n    * [Modular lucas sequences U V](./Math/modular_lucas_sequences_U_V.sf)\n    * [Modular multiplicative inverse](./Math/modular_multiplicative_inverse.sf)\n    * [Modular square root all solutions](./Math/modular_square_root_all_solutions.sf)\n    * [Modular tetration](./Math/modular_tetration.sf)\n    * [Moebius transform](./Math/moebius_transform.sf)\n    * [Moebius transform fast](./Math/moebius_transform_fast.sf)\n    * [Moessner miracle](./Math/moessner_miracle.sf)\n    * [Motzkin numbers](./Math/motzkin_numbers.sf)\n    * [Motzkin triangle](./Math/motzkin_triangle.sf)\n    * [Multiple modular multiplicative inversions](./Math/multiple_modular_multiplicative_inversions.sf)\n    * [Multiplicative order](./Math/multiplicative_order.sf)\n    * [Multiplicative order from phi](./Math/multiplicative_order_from_phi.sf)\n    * [N-bit random prime](./Math/n-bit_random_prime.sf)\n    * [Narcisistic harmonic numbers](./Math/narcisistic_harmonic_numbers.sf)\n    * [Near-power factorization method](./Math/near-power_factorization_method.sf)\n    * [Newton's method for polynomials](./Math/newton_s_method_for_polynomials.sf)\n    * [Next palindrome in base](./Math/next_palindrome_in_base.sf)\n    * [Non-bouncy numbers](./Math/non-bouncy_numbers.sf)\n    * [Nth composite](./Math/nth_composite.sf)\n    * [Nth digit of fraction](./Math/nth_digit_of_fraction.sf)\n    * [Nth k-powerfree](./Math/nth_k-powerfree.sf)\n    * [Nth prime](./Math/nth_prime.sf)\n    * [Nth prime power](./Math/nth_prime_power.sf)\n    * [Nth root good rational approximations](./Math/nth_root_good_rational_approximations.sf)\n    * [Nth smooth number](./Math/nth_smooth_number.sf)\n    * [Nth squarefree](./Math/nth_squarefree.sf)\n    * [Number2expression](./Math/number2expression.sf)\n    * [Number of mXn arrays with rows being permutations](./Math/number_of_mXn_arrays_with_rows_being_permutations.sf)\n    * [Number of representations as sum of 3 triangles](./Math/number_of_representations_as_sum_of_3_triangles.sf)\n    * [Number to continued fraction](./Math/number_to_continued_fraction.sf)\n    * [Number to digits subquadratic algorithm](./Math/number_to_digits_subquadratic_algorithm.sf)\n    * [Number to digits subquadratic algorithm 2](./Math/number_to_digits_subquadratic_algorithm_2.sf)\n    * [Number to expression form](./Math/number_to_expression_form.sf)\n    * [Numbers with digitsum](./Math/numbers_with_digitsum.sf)\n    * [Numbers with non decimal digits](./Math/numbers_with_non_decimal_digits.sf)\n    * [Numerical differentiation](./Math/numerical_differentiation.sf)\n    * [Omega prime divisors](./Math/omega_prime_divisors.sf)\n    * [Omega prime numbers in range](./Math/omega_prime_numbers_in_range.sf)\n    * [Ore's harmonic numbers](./Math/ore_s_harmonic_numbers.sf)\n    * [Palindromic primes](./Math/palindromic_primes.sf)\n    * [Partial sum of the alternating sum of divisors](./Math/partial_sum_of_the_alternating_sum_of_divisors.sf)\n    * [Partial sums of 2 to the bigomega of n](./Math/partial_sums_of_2_to_the_bigomega_of_n.sf)\n    * [Partial sums of core function](./Math/partial_sums_of_core_function.sf)\n    * [Partial sums of dedekind psi function](./Math/partial_sums_of_dedekind_psi_function.sf)\n    * [Partial sums of dedekind psi function recursive](./Math/partial_sums_of_dedekind_psi_function_recursive.sf)\n    * [Partial sums of euler totient function](./Math/partial_sums_of_euler_totient_function.sf)\n    * [Partial sums of euler totient function recursive](./Math/partial_sums_of_euler_totient_function_recursive.sf)\n    * [Partial sums of euler totient function times k to the m](./Math/partial_sums_of_euler_totient_function_times_k_to_the_m.sf)\n    * [Partial sums of exponential prime omega functions](./Math/partial_sums_of_exponential_prime_omega_functions.sf)\n    * [Partial sums of gcd-sum function](./Math/partial_sums_of_gcd-sum_function.sf)\n    * [Partial sums of gcd-sum function fast](./Math/partial_sums_of_gcd-sum_function_fast.sf)\n    * [Partial sums of generalized gcd-sum function](./Math/partial_sums_of_generalized_gcd-sum_function.sf)\n    * [Partial sums of gpf](./Math/partial_sums_of_gpf.sf)\n    * [Partial sums of inverse moebius transform of dedekind function](./Math/partial_sums_of_inverse_moebius_transform_of_dedekind_function.sf)\n    * [Partial sums of jordan totient function](./Math/partial_sums_of_jordan_totient_function.sf)\n    * [Partial sums of jordan totient function times k to the m](./Math/partial_sums_of_jordan_totient_function_times_k_to_the_m.sf)\n    * [Partial sums of lcm count function](./Math/partial_sums_of_lcm_count_function.sf)\n    * [Partial sums of lpf](./Math/partial_sums_of_lpf.sf)\n    * [Partial sums of powerfree numbers](./Math/partial_sums_of_powerfree_numbers.sf)\n    * [Partial sums of powerfree part](./Math/partial_sums_of_powerfree_part.sf)\n    * [Partial sums of prime bigomega function](./Math/partial_sums_of_prime_bigomega_function.sf)\n    * [Partial sums of prime omega function](./Math/partial_sums_of_prime_omega_function.sf)\n    * [Partial sums of sigma function](./Math/partial_sums_of_sigma_function.sf)\n    * [Partial sums of sigma function fast](./Math/partial_sums_of_sigma_function_fast.sf)\n    * [Partial sums of sigma function times k to the m](./Math/partial_sums_of_sigma_function_times_k_to_the_m.sf)\n    * [Partial sums of squarefree numbers](./Math/partial_sums_of_squarefree_numbers.sf)\n    * [Partial sums recursive sublinear formula](./Math/partial_sums_recursive_sublinear_formula.sf)\n    * [Partial sums recursive sublinear formula general](./Math/partial_sums_recursive_sublinear_formula_general.sf)\n    * [Partial sums sublinear formula](./Math/partial_sums_sublinear_formula.sf)\n    * [Partition function](./Math/partition_function.sf)\n    * [Pell-holf factorization](./Math/pell-holf_factorization.sf)\n    * [Pell factorization](./Math/pell_factorization.sf)\n    * [Pell method for square roots](./Math/pell_method_for_square_roots.sf)\n    * [Pepin-proth primality test generalized](./Math/pepin-proth_primality_test_generalized.sf)\n    * [Perfect squares in catalan's triangle](./Math/perfect_squares_in_catalan_s_triangle.sf)\n    * [Permutations iter](./Math/permutations_iter.sf)\n    * [Permutations rec](./Math/permutations_rec.sf)\n    * [Phi finder factorization algorithm](./Math/phi_finder_factorization_algorithm.sf)\n    * [Pi from perimeters of polygons](./Math/pi_from_perimeters_of_polygons.sf)\n    * [Pillai arithmetical function](./Math/pillai_arithmetical_function.sf)\n    * [Pisano periods](./Math/pisano_periods.sf)\n    * [Pisano periods efficient algorithm](./Math/pisano_periods_efficient_algorithm.sf)\n    * [Pisano periods of lucas U sequence](./Math/pisano_periods_of_lucas_U_sequence.sf)\n    * [Pocklington-pratt primality proving](./Math/pocklington-pratt_primality_proving.sf)\n    * [Pollard-brent rho factor](./Math/pollard-brent_rho_factor.sf)\n    * [Pollard-gauss factorization method](./Math/pollard-gauss_factorization_method.sf)\n    * [Pollard-strassen factorization method](./Math/pollard-strassen_factorization_method.sf)\n    * [Pollard-strassen factorization method no polynomials](./Math/pollard-strassen_factorization_method_no_polynomials.sf)\n    * [Pollard-strassen factorization method polymod](./Math/pollard-strassen_factorization_method_polymod.sf)\n    * [Pollard p-1 factorization](./Math/pollard_p-1_factorization.sf)\n    * [Pollard rho-exp factorization](./Math/pollard_rho-exp_factorization.sf)\n    * [Pollard rho factorization](./Math/pollard_rho_factorization.sf)\n    * [Polygonal representations](./Math/polygonal_representations.sf)\n    * [Polynomial factorization in finite field](./Math/polynomial_factorization_in_finite_field.sf)\n    * [Polynomial factorization monte carlo](./Math/polynomial_factorization_monte_carlo.sf)\n    * [Polynomial interpolation](./Math/polynomial_interpolation.sf)\n    * [Polynomial regression](./Math/polynomial_regression.sf)\n    * [Polynomial roots](./Math/polynomial_roots.sf)\n    * [Pomerance condition for bpsw counter-example](./Math/pomerance_condition_for_bpsw_counter-example.sf)\n    * [Power divisors](./Math/power_divisors.sf)\n    * [Power integers](./Math/power_integers.sf)\n    * [Power of 2 plus 3 primes lucas-lehmer](./Math/power_of_2_plus_3_primes_lucas-lehmer.sf)\n    * [Power of 2 plus 5 primes lucas-lehmer](./Math/power_of_2_plus_5_primes_lucas-lehmer.sf)\n    * [Power sigma](./Math/power_sigma.sf)\n    * [Power unitary divisors](./Math/power_unitary_divisors.sf)\n    * [Power usigma](./Math/power_usigma.sf)\n    * [Powerfree divisors](./Math/powerfree_divisors.sf)\n    * [Powerfree sigma](./Math/powerfree_sigma.sf)\n    * [Powerfree usigma](./Math/powerfree_usigma.sf)\n    * [Primality precheck](./Math/primality_precheck.sf)\n    * [Primality testing fermat fourier](./Math/primality_testing_fermat_fourier.sf)\n    * [Primality testing wilson fourier](./Math/primality_testing_wilson_fourier.sf)\n    * [Prime big omega function generalized](./Math/prime_big_omega_function_generalized.sf)\n    * [Prime big omega function generalized old](./Math/prime_big_omega_function_generalized_old.sf)\n    * [Prime omega function generalized](./Math/prime_omega_function_generalized.sf)\n    * [Prime power counting function](./Math/prime_power_counting_function.sf)\n    * [Prime recursive representation](./Math/prime_recursive_representation.sf)\n    * [Primitive part of a function](./Math/primitive_part_of_a_function.sf)\n    * [Primorial deflation](./Math/primorial_deflation.sf)\n    * [Problem of apollonius](./Math/problem_of_apollonius.sf)\n    * [Product of prime sigmas of divisors](./Math/product_of_prime_sigmas_of_divisors.sf)\n    * [Product of primes approx](./Math/product_of_primes_approx.sf)\n    * [Product tree](./Math/product_tree.sf)\n    * [PSW primality test](./Math/PSW_primality_test.sf)\n    * [Pythagorean means](./Math/pythagorean_means.sf)\n    * [Quadratic-integer factorization method](./Math/quadratic-integer_factorization_method.sf)\n    * [Quadratic form representations](./Math/quadratic_form_representations.sf)\n    * [Quadratic formula solution approx](./Math/quadratic_formula_solution_approx.sf)\n    * [Quadratic frobenius primality test](./Math/quadratic_frobenius_primality_test.sf)\n    * [Quadratic frobenius primality test explicit](./Math/quadratic_frobenius_primality_test_explicit.sf)\n    * [Quadratic integers](./Math/quadratic_integers.sf)\n    * [Quaternion integer primality test](./Math/quaternion_integer_primality_test.sf)\n    * [Quaternion integers](./Math/quaternion_integers.sf)\n    * [Rabin encryption method](./Math/rabin_encryption_method.sf)\n    * [Ramanujan sum](./Math/ramanujan_sum.sf)\n    * [Rational approximations](./Math/rational_approximations.sf)\n    * [Recaman-like sequence](./Math/recaman-like_sequence.sf)\n    * [Recaman's sequence](./Math/recaman_s_sequence.sf)\n    * [Recursive gcd prime generator](./Math/recursive_gcd_prime_generator.sf)\n    * [Recursive summation of fractions](./Math/recursive_summation_of_fractions.sf)\n    * [Reformulation of the arctangent function](./Math/reformulation_of_the_arctangent_function.sf)\n    * [Remainder tree](./Math/remainder_tree.sf)\n    * [Repunits from repunits](./Math/repunits_from_repunits.sf)\n    * [Right truncatable primes](./Math/right_truncatable_primes.sf)\n    * [Right truncatable primes in base](./Math/right_truncatable_primes_in_base.sf)\n    * [Roots of unity convergents](./Math/roots_of_unity_convergents.sf)\n    * [Round half to even](./Math/round_half_to_even.sf)\n    * [RSA algorithm](./Math/RSA_algorithm.sf)\n    * [Same squarefree kernel](./Math/same_squarefree_kernel.sf)\n    * [Secant numbers](./Math/secant_numbers.sf)\n    * [Semiconvergents](./Math/semiconvergents.sf)\n    * [Semiprime count](./Math/semiprime_count.sf)\n    * [Sequence polynomial closed form](./Math/sequence_polynomial_closed_form.sf)\n    * [Sequence succesive differences](./Math/sequence_succesive_differences.sf)\n    * [Shor's algorithm](./Math/shor_s_algorithm.sf)\n    * [Sierpinski diamond](./Math/sierpinski_diamond.sf)\n    * [Sierpinski sidef](./Math/sierpinski_sidef.sf)\n    * [Sierpinski triangle](./Math/sierpinski_triangle.sf)\n    * [Sierpinski triangle 90](./Math/sierpinski_triangle_90.sf)\n    * [Sierpinski x](./Math/sierpinski_x.sf)\n    * [Sigma of product of binomials](./Math/sigma_of_product_of_binomials.sf)\n    * [Siqs factorization](./Math/siqs_factorization.sf)\n    * [Smallest carmichael divisible by n](./Math/smallest_carmichael_divisible_by_n.sf)\n    * [Smallest carmichael divisible by n faster](./Math/smallest_carmichael_divisible_by_n_faster.sf)\n    * [Smallest k-gonal inverse](./Math/smallest_k-gonal_inverse.sf)\n    * [Smallest lucas-carmichael divisible by n](./Math/smallest_lucas-carmichael_divisible_by_n.sf)\n    * [Smallest lucas-carmichael divisible by n faster](./Math/smallest_lucas-carmichael_divisible_by_n_faster.sf)\n    * [Smallest number with at least n divisors](./Math/smallest_number_with_at_least_n_divisors.sf)\n    * [Smallest number with n divisors](./Math/smallest_number_with_n_divisors.sf)\n    * [Smallest number with n odd divisors](./Math/smallest_number_with_n_odd_divisors.sf)\n    * [Solovay-strassen primality test](./Math/solovay-strassen_primality_test.sf)\n    * [Solve cubic equation](./Math/solve_cubic_equation.sf)\n    * [Solve cubic equation real](./Math/solve_cubic_equation_real.sf)\n    * [Solve linear congruence equation](./Math/solve_linear_congruence_equation.sf)\n    * [Solve modular quadratic equation](./Math/solve_modular_quadratic_equation.sf)\n    * [Solve pell equation](./Math/solve_pell_equation.sf)\n    * [Solve quadratic diophantine reciprocals](./Math/solve_quadratic_diophantine_reciprocals.sf)\n    * [Solve reciprocal pythagorean equation](./Math/solve_reciprocal_pythagorean_equation.sf)\n    * [Solve recursive sequence](./Math/solve_recursive_sequence.sf)\n    * [Solve sequence](./Math/solve_sequence.sf)\n    * [Sophie germain factorization method](./Math/sophie_germain_factorization_method.sf)\n    * [Sophie germain factorization method fast](./Math/sophie_germain_factorization_method_fast.sf)\n    * [Special factorization identity](./Math/special_factorization_identity.sf)\n    * [Split summation](./Math/split_summation.sf)\n    * [Sqrt 2 approximation](./Math/sqrt_2_approximation.sf)\n    * [Sqrt convergents](./Math/sqrt_convergents.sf)\n    * [Square-full numbers](./Math/square-full_numbers.sf)\n    * [Square congruence lookup factorization](./Math/square_congruence_lookup_factorization.sf)\n    * [Square form factorization method](./Math/square_form_factorization_method.sf)\n    * [Square product subsets](./Math/square_product_subsets.sf)\n    * [Square root arithmetic-harmonic mean](./Math/square_root_arithmetic-harmonic_mean.sf)\n    * [Square root good rational approximations](./Math/square_root_good_rational_approximations.sf)\n    * [Square root modulo n](./Math/square_root_modulo_n.sf)\n    * [Square root modulo n tonelli-shanks](./Math/square_root_modulo_n_tonelli-shanks.sf)\n    * [Squarefree almost primes in range](./Math/squarefree_almost_primes_in_range.sf)\n    * [Squarefree fermat overpseudoprimes in range](./Math/squarefree_fermat_overpseudoprimes_in_range.sf)\n    * [Squarefree fermat pseudoprimes in range](./Math/squarefree_fermat_pseudoprimes_in_range.sf)\n    * [Squarefree lucas U pseudoprimes in range](./Math/squarefree_lucas_U_pseudoprimes_in_range.sf)\n    * [Squarefree strong fermat pseudoprimes in range](./Math/squarefree_strong_fermat_pseudoprimes_in_range.sf)\n    * [Stable marriage problem](./Math/stable_marriage_problem.sf)\n    * [Stern brocot continued fraction](./Math/stern_brocot_continued_fraction.sf)\n    * [Stern brocot encoding](./Math/stern_brocot_encoding.sf)\n    * [Stern brocot encoding matrix form](./Math/stern_brocot_encoding_matrix_form.sf)\n    * [Stirling factorial correction terms](./Math/stirling_factorial_correction_terms.sf)\n    * [Strange numbers in base n](./Math/strange_numbers_in_base_n.sf)\n    * [Strong fermat pseudoprimes in range](./Math/strong_fermat_pseudoprimes_in_range.sf)\n    * [Sub-unit squares](./Math/sub-unit_squares.sf)\n    * [Substring primes in base n](./Math/substring_primes_in_base_n.sf)\n    * [Sum of cubes function nonnegative recursive](./Math/sum_of_cubes_function_nonnegative_recursive.sf)\n    * [Sum of cubes function recursive](./Math/sum_of_cubes_function_recursive.sf)\n    * [Sum of digits subquadratic algorithm](./Math/sum_of_digits_subquadratic_algorithm.sf)\n    * [Sum of k-almost primes](./Math/sum_of_k-almost_primes.sf)\n    * [Sum of k-omega primes](./Math/sum_of_k-omega_primes.sf)\n    * [Sum of k-powerful numbers](./Math/sum_of_k-powerful_numbers.sf)\n    * [Sum of k-powerful numbers in range](./Math/sum_of_k-powerful_numbers_in_range.sf)\n    * [Sum of nth power digits](./Math/sum_of_nth_power_digits.sf)\n    * [Sum of number of divisors of gcd x y](./Math/sum_of_number_of_divisors_of_gcd_x_y.sf)\n    * [Sum of number of unitary divisors](./Math/sum_of_number_of_unitary_divisors.sf)\n    * [Sum of perfect powers](./Math/sum_of_perfect_powers.sf)\n    * [Sum of polygonal numbers function recursive](./Math/sum_of_polygonal_numbers_function_recursive.sf)\n    * [Sum of prime-power exponents of factorial](./Math/sum_of_prime-power_exponents_of_factorial.sf)\n    * [Sum of prime-power exponents of product of binomials](./Math/sum_of_prime-power_exponents_of_product_of_binomials.sf)\n    * [Sum of prime powers](./Math/sum_of_prime_powers.sf)\n    * [Sum of primes](./Math/sum_of_primes.sf)\n    * [Sum of remainders](./Math/sum_of_remainders.sf)\n    * [Sum of squarefree k-almost primes](./Math/sum_of_squarefree_k-almost_primes.sf)\n    * [Sum of squares function identities](./Math/sum_of_squares_function_identities.sf)\n    * [Sum of squares function recursive](./Math/sum_of_squares_function_recursive.sf)\n    * [Sum of two rectangles solutions](./Math/sum_of_two_rectangles_solutions.sf)\n    * [Sum of two squares all solutions](./Math/sum_of_two_squares_all_solutions.sf)\n    * [Sum of two squares solutions](./Math/sum_of_two_squares_solutions.sf)\n    * [Sum of two squares solutions tonelli-shanks](./Math/sum_of_two_squares_solutions_tonelli-shanks.sf)\n    * [Sums of power sums formula](./Math/sums_of_power_sums_formula.sf)\n    * [Superfactorial and hyperfactorial](./Math/superfactorial_and_hyperfactorial.sf)\n    * [Symbolic math](./Math/symbolic_math.sf)\n    * [System of linear equations](./Math/system_of_linear_equations.sf)\n    * [Tangent numbers](./Math/tangent_numbers.sf)\n    * [Tonelli shanks algorithm](./Math/tonelli_shanks_algorithm.sf)\n    * [Tower of distinct powers](./Math/tower_of_distinct_powers.sf)\n    * [Tower of powers inverse](./Math/tower_of_powers_inverse.sf)\n    * [Towers of hanoi](./Math/towers_of_hanoi.sf)\n    * [Trial division fast](./Math/trial_division_fast.sf)\n    * [Trial division with primorials](./Math/trial_division_with_primorials.sf)\n    * [Tribonacci closed form](./Math/tribonacci_closed_form.sf)\n    * [Tribonacci numbers](./Math/tribonacci_numbers.sf)\n    * [Tribonacci primality test](./Math/tribonacci_primality_test.sf)\n    * [Twin primes from partial products](./Math/twin_primes_from_partial_products.sf)\n    * [Unitary divisors](./Math/unitary_divisors.sf)\n    * [Unitary powerfree divisors](./Math/unitary_powerfree_divisors.sf)\n    * [Unitary powerfree sigma](./Math/unitary_powerfree_sigma.sf)\n    * [Unreduced continued fractions](./Math/unreduced_continued_fractions.sf)\n    * [Unreduced fractions](./Math/unreduced_fractions.sf)\n    * [Vampire numbers](./Math/vampire_numbers.sf)\n    * [Viete-like formulas](./Math/viete-like_formulas.sf)\n    * [Viswanath's constant conjecture](./Math/viswanath_s_constant_conjecture.sf)\n    * [Weighted prime power count](./Math/weighted_prime_power_count.sf)\n    * [Y combinator](./Math/y_combinator.sf)\n    * [Zeta 2n](./Math/zeta_2n.sf)\n    * [Zeta 3 fast convergence](./Math/zeta_3_fast_convergence.sf)\n    * [Zeta derivative at trivial zeros](./Math/zeta_derivative_at_trivial_zeros.sf)\n* Other\n    * [Hex randomness info](./Other/hex_randomness_info.sf)\n    * [Mortality-natality simulation](./Other/mortality-natality_simulation.sf)\n    * [Prime birthday](./Other/prime_birthday.sf)\n* PL\n    * [Brainf compiler](./PL/brainf_compiler.sf)\n    * [Sidef interpreter](./PL/sidef_interpreter.sf)\n* Probability\n    * [Rejection sampling](./Probability/rejection_sampling.sf)\n* Search\n    * [Binary search iter](./Search/binary_search_iter.sf)\n    * [Binary search rec](./Search/binary_search_rec.sf)\n* Simulation\n    * [Pendulum animation](./Simulation/pendulum_animation.sf)\n    * [Universal turing machine](./Simulation/universal_turing_machine.sf)\n    * [Virtual machine](./Simulation/virtual_machine.sf)\n* Socket\n    * [Socket](./Socket/socket.sf)\n    * [Socket inet](./Socket/socket_inet.sf)\n* Sort\n    * [Bubble sort](./Sort/bubble_sort.sf)\n    * [Circlesort](./Sort/circlesort.sf)\n    * [Cocktail sort](./Sort/cocktail_sort.sf)\n    * [Comb sort](./Sort/comb_sort.sf)\n    * [Counting sort](./Sort/counting_sort.sf)\n    * [Dream sort](./Sort/dream_sort.sf)\n    * [Gnome sort](./Sort/gnome_sort.sf)\n    * [Heapsort](./Sort/heapsort.sf)\n    * [Insertion sort](./Sort/insertion_sort.sf)\n    * [Merge sort](./Sort/merge_sort.sf)\n    * [Patience sort](./Sort/patience_sort.sf)\n    * [Quicksort](./Sort/quicksort.sf)\n    * [Radix sort](./Sort/radix_sort.sf)\n    * [Selection sort](./Sort/selection_sort.sf)\n    * [Shell sort](./Sort/shell_sort.sf)\n    * [Sleep sort](./Sort/sleep_sort.sf)\n    * [Stooge sort](./Sort/stooge_sort.sf)\n    * [Strand sort](./Sort/strand_sort.sf)\n* Term\n    * [Draw a clock](./Term/draw_a_clock.sf)\n* Text\n    * [Boyer-moore string search algorithm](./Text/boyer-moore_string_search_algorithm.sf)\n    * [Brace expansion](./Text/brace_expansion.sf)\n    * [Jaro distance](./Text/jaro_distance.sf)\n    * [Knuth-morris-pratt string search](./Text/knuth-morris-pratt_string_search.sf)\n    * [Longest common prefix](./Text/longest_common_prefix.sf)\n    * [Longest common subsequence](./Text/longest_common_subsequence.sf)\n    * [Markov chain text generator](./Text/markov_chain_text_generator.sf)\n    * [Ordered concatenations](./Text/ordered_concatenations.sf)\n    * [Shell string expand](./Text/shell_string_expand.sf)\n    * [Simple string search](./Text/simple_string_search.sf)\n    * [Smart word wrap lazy](./Text/smart_word_wrap_lazy.sf)\n    * [Soundex](./Text/soundex.sf)\n* Time\n    * [Calendar](./Time/calendar.sf)\n    * [Month calendar](./Time/month_calendar.sf)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftrizen%2Fsidef-scripts","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftrizen%2Fsidef-scripts","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftrizen%2Fsidef-scripts/lists"}