Flatiron Data Science Blog

This weeks blog post will be another continuation of my Project Euler series.   As a reference, I've once again included a link to my first post on this topic where I give an overview.   This post will be dealing with two problems that I worked on, specifically problems 41 and 48.  I will give a brief overview of each problem before diving into the concepts they discuss and my methodology for solving them. Below is the first problem I will be discussing, number 41.  As can be seen from the title of the problem on the Project Euler archive, this question deals with a phenomenon known as pandigital prime numbers.  This is a number which contains all of the integers from 1 to n exactly once where n is a given base and is also prime.  Zero is generally included in these numbers, but this question has specifically requested we start with one.  An example of a pandigital number under this definition would be 123, in the case that n = 3.  This is not, however, a pandigital prime because i

  I've decided to continue on with the second installment of my Project Euler series in this most recent blog post, with this one conforming more to the structure that can be expected from now on.  As a reference, I've included a link to my first post on this topic where I give an overview.   This post will be dealing with two problems that I worked on, specifically problems 27 and 29.  I will give a brief overview of each problem before diving into the concepts they discuss and my methodology for solving them. Below is the first problem I will be discussing, number 27.   This problem is a bit more complex than others that I have attempted so far.  The above gives two examples that are actually quite useful in solving the problem.  Normally Project Euler problems will opt to show a more elementary version of the problem they would like us to solve.  For example they might show a summation of the numbers one through ten and then request the sum of one to one thousand.  In this i

This blog post marks a slight change in direction for me, as well as the introduction to what I hope will become a series here: "Exploring Project Euler."  It is my intention to publish multiple posts on this topic, so if you see some variation of that title multiple times on this blog just know that (1) these are distinct but loosely related posts, and (2) this particular post is the first installment, where I will dedicate some time to introducing and explaining the concept behind this series.  I plan on linking to this blog at the beginning of each subsequent post to prevent any confusion.   To begin with, I will give an overview of what Project Euler is exactly.  It is a website dedicated to hosting a number of computation problems that can be solved using computer programming.  I will specifically be examining the archives which, as of this writing, contain 736 of these problems.  An interesting detail concerning these problems is that they are not listed randomly, but i

  This week I have decided to take an in depth look at the two main types of machine learning, supervised and unsupervised.  While this is a topic that was covered in my recent data science course, I found myself particularly curious about it and wanted to dig in a bit deeper.  There are a few particular angles from which I would like to approach this subject, so I will lay out my plans here.  First and most importantly, I will provide a satisfactory definition for each of these two terms.  I will then examine the key differences between the two types of machine learning.   Finally, I will examine several different examples and use cases for both of these.  To provide a bit of context for the conversation, machine learning, both supervised and unsupervised, is essentially the use of an algorithm to detect certain patterns within a data set.  While it might sound like there isn't much leeway within that category for significant differences between the two types of machine learning,