Online Lemoine’s Conjecture Demo in Go

2n + 1 = p + 2q always has a solution in primes p and q (not necessarily distinct) for n > 2. This online demo finds p and q for given odd number greater than 5. The demo is written in Go and compiled to JavaScript using GopherJS.

 read more »

Lemoine’s Conjecture

2n + 1 = p + 2q always has a solution in primes p and q (not necessarily distinct) for n > 2. Write a Go program to find p and q for given odd number greater than 5.

 read more »

[Golang] Get Instagram User ID

Given user name, get Instagram user id via Go programming language. Use only Go standard library and no third-party packages needed.

 read more »

Frontend Programming in Go

Discuss why I choose Go to be my frontend programming language. Wirte Go code and run your application on web browsers.

 read more »

[Golang] Goldbach's conjecture

Goldbach's conjecture - Every even integer greater than 2 can be written as the sum of two primes. Given a positive even integer, write a Go program to find the two primes.

 read more »

[Dart] Modal (Popup)

Modal (Popup) implementation via Dart and CSS. Modal is dialog box/popup window that is displayed on top of the current page.

 read more »

[Vue.js] Modal (Popup)

Modal (Popup) implementation via Vue.js and CSS. Modal is dialog box/popup window that is displayed on top of the current page.

 read more »

[Vue.js] HTML Select Element Example

Use Vue.js to manipulate HTML select element. First show how to use v-model directive to create data bindings for select element. Then use the selected option to make some animation via animate.css.

 read more »

[Golang] BK-tree Data Structure Implementation

Go implementation of BK-tree data structure used for approximate string matching in a dictionary. The distance metric here is Levenshtein distance, the minimum number of single-character edits (insertions, deletions or substitutions) required to change one string into the other.

 read more »

[Golang] Levenshtein Distance Recursive Implementation

Recursive implementation of Levenshtein distance algorithm in Go programming language. Levenshtein distance (LD) is a measure of the similarity between two strings, the minimum number of single-character edits (insertions, deletions or substitutions) required to change one string into the other.

 read more »