Problem All square roots are periodic when written as continued fractions and can be written in the form: For example, let us consider ?23: If we continue we would get the following expansion: The process can be summarised as follows: It can be seen that the sequence is repeating. For conciseness, we use the notation …
Problem It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all. The square root of two is 1.41421356237309504880…, and the digital sum of the first one hundred decimal digits …
Problem Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae: The ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties. The set is cyclic, in that the last two digits of each number is the first two digits of the …
Bit Syntax in Erlang One of the often under-appreciated features of Erlang is its Bit Syntax for parsing and pattern matching binary data at a bit level. For instance, to pare TCP segments you can write something along the line of: The same capability can be applied to anything binary protocols, such as video encoding, …
F# – Imitating Erlang’s bit syntax for easier binary protocol implementation Read More »
It’s been a little while since I last spent time with Elm, and since Elm 0.13 was recently announced so what better time to get my Elm hat back on and see what’s new. There’s a new-look online debugger which looks prettier than before: but more important than that, is the new Elm Reactor command …
Elm – building a version of Snake in under 100 lines of code Read More »
DISCLAIMER : as always, you should benchmark against your payload and use case, the benchmark numbers I have produced here is unlikely to be representative of your use cases and neither is anybody else’s benchmark numbers. You can use the simple test harness I created and see these example code to benchmark against your particular …
On application monitoring In the Gamesys social team, our view on application monitoring is such that anything that runs in production needs to be monitored extensively all the time – every service entry point, IO operations or CPU intensive tasks. Sure, it comes at the cost of a few CPU cycles which might mean that …
The monster trapping mechanics in Here Be Monsters is fairly straight forward: Monsters have a type and a set of stats – Strength, Speed and IQ They have a rarity value which determines the likelihood of an encounter They have a set of baits they like, which can increase the likelihood of an encounter Traps …
F# – genetic algorithms to help you catch monsters Read More »
Nowadays you see plenty of stories about Continuous Integration, Continuous Delivery and Continuous Deployment on the web, and it’s great to see that the industry is moving in this direction, with more and more focus on automation rather than hiring humans to do a job that machines are so much better at. But, most of …
Red-White Push – Continuous Delivery at Gamesys Social Read More »
DISCLAIMER : as always, you should benchmark against your payload and use case, the benchmark numbers I have produced here is unlikely to be representative of your use cases and neither is anybody else’s benchmark numbers. You can use the simple test harness I created and see these example code to benchmark against your particular …
By continuing to use the site, you agree to the use of cookies. more information
The cookie settings on this website are set to "allow cookies" to give you the best browsing experience possible. If you continue to use this website without changing your cookie settings or you click "Accept" below then you are consenting to this.