Counting non-intersecting double-diagonals in polygons
MathJax.Hub.Config({ tex2jax: { inlineMath: [['$','$'], ['\\(','\\)']], displayMath: [['$$','$$'], ['\[','\]']], processEscapes: true, processEnvironments: true, skipTags: ['script', 'noscript', 'style', 'textarea', 'pre'], TeX: { equationNumbers: { autoNumber: "AMS" }, extensions: ["AMSmath.js", "AMSsymbols.js"] } } }); MathJax.Hub.Queue(function() { // Fix tags after MathJax finishes running. This is a // hack to overcome a shortcoming of Markdown. Discussion at // https://github.com/mojombo/jekyll/issues/199 var all = MathJax.Hub.getAllJax(), i; for(i = 0; i The purpose of this blog post is to outline some deliberate practice I’ve done on solving a problem.
Solving a simple puzzle using SymPy
I came across this problem recently: It’s about a square that gets partitioned into rectangles of equal area (some sources call this "floorplan" ). One of the sides of these smaller rectangles is given and the problem asks for the area of the large square. It’s possible to build equations for: the known side of the small rectangle the smaller rectangle sides that add up to the same length of the large square side-length
Building offline archives
Intro I’ve been looking into some ways to work offline. Here are some reasons for that: Decrease in the quality of general purpose search engine results More targetted searches Better response times and decreased latency for slow websites (since after I download them they’re served from my local network, maybe directly from the disk of my laptop) Sites are disappearing at a high rate.