Dec 8, 2021

3 min read

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:

More from applied.math.coding

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.

Try Knowable

Recommended from Medium

Lin Shih Hao

How to create dependent drop-down list in NetSuite

Zhang Zeyu

JavaScript in Plain English

Build a Simple Chess AI in JavaScript

Sean Dever

Working with Slices in Go(golang)

Sümeyra Davran

The Startup

Javascript fundamentals-Global Scope

Russell Smith

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

Steven Atkinson

JM09K Matrix Keypad Quirks

Jared Nutt

codeburst

Project Euler Problem 3 Solved with Javascript

Dino Trnka

Ministry of Programming — Technology

50 React Native Tips — Part 1/2

About Help Terms Privacy

Counting Diagonals in Regular Polyhedrons.

The problem:

More from applied.math.coding

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

applied.math.coding

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