This starts with comparative programming. I had reason to code some Python recently, and I discovered that there was a built-in to tell if an element is in a list.| Committed to Memory
Welcome to Weekly Challenge #258!| Committed to Memory
gizmomathboy told me to write a note, because I hadn’t touched this process for years. This is me writing that note.| Committed to Memory
I avoided looking at GitHub Actions for a long time. I had set some automation on a few things with Appveyor and TravisCI, but the things I was coding were for work and not using GitHub, and the things I had added automation to were stable. I doubt I’ve done anything with some of the repos but test the testing. 🤓| Committed to Memory
One of the things I noticed when doing my meandering HackLafayette talk about VS Code was GitLens, which is an improvement on the existing Git implementation in VS Code.| Committed to Memory
I recently gave a presentation about VS Code to members of my local developer group, HackLafayette. I worked through several bullet points in a fairly stream-of-consciousness and showed off a lot of how I use VS Code.| Committed to Memory
Welcome to Weekly Challenge #257! [257(https://en.wikipedia.org/wiki/257(number))] is a _prime number, of the form 22n+1. It is also an irregular prime and a Jacobsthal-Lucas number.| Committed to Memory
Welcome to Weekly Challenge #256! 256 is a perfect square, being 162. Of course, 42 = 16, and also 22 = 4, so 256 is a perfect square of a perfect square of a perfect square.| Committed to Memory
Welcome to Weekly Challenge #255!, 255 is the product of 3, 5 and 17. It also equals 28 - 1, which makes it a Mersenne number but not a Mersenne Prime. And, of course, it is 11111111 in binary, which is the largest integer which can be represented by one byte.| Committed to Memory
Welcome to Weekly Challenge #254! 254, the product of 2 and 127, is a semiprime number. It is deficient, in that the sum of its divisors is 130, which is less than itself.| Committed to Memory