Counting Diagonals in Regular Polyhedrons.

If you are fascinated about inventing algorithms to solve combinatorial problems, then this story is for you!

First we will formulate the problem, then we are going to look at a possible algorithm that will be proofed to work correctly, and finally we are looking at an implementation in Rust and JavaScript.

The problem:

--

--

--

I am a mathematician and software developer who likes writing advanced code and to do research in applied and pure mathematics.

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

How to create dependent drop-down list in NetSuite

Build a Simple Chess AI in JavaScript

Working with Slices in Go(golang)

Javascript fundamentals-Global Scope

3D to 2D pt.3 — Updating the Enemy.

JM09K Matrix Keypad Quirks

Project Euler Problem 3 Solved with Javascript

50 React Native Tips — Part 1/2

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
applied.math.coding

applied.math.coding

I am a mathematician and software developer who likes writing advanced code and to do research in applied and pure mathematics.

More from Medium

Counting the number of n-digit numbers with at most k repetitions.

Generic Interface for Baremetal Task Management in Rust

How variables are saved in Python and Rust. Side by Side 7: dict/HashMap

Python vs Rust: Key points and takeaways