{"action":"closed","issue":{"url":"https://api.github.com/repos/FreeCodeCamp/hikes/issues/4","repository_url":"https://api.github.com/repos/FreeCodeCamp/hikes","labels_url":"https://api.github.com/repos/FreeCodeCamp/hikes/issues/4/labels{/name}","comments_url":"https://api.github.com/repos/FreeCodeCamp/hikes/issues/4/comments","events_url":"https://api.github.com/repos/FreeCodeCamp/hikes/issues/4/events","html_url":"https://github.com/FreeCodeCamp/hikes/issues/4","id":124260054,"number":4,"title":"Discrete Mathematics 3: What is Discrete Mathematics? - Script","user":{"login":"SEGrooms","id":13191387,"avatar_url":"https://avatars.githubusercontent.com/u/13191387?v=3","gravatar_id":"","url":"https://api.github.com/users/SEGrooms","html_url":"https://github.com/SEGrooms","followers_url":"https://api.github.com/users/SEGrooms/followers","following_url":"https://api.github.com/users/SEGrooms/following{/other_user}","gists_url":"https://api.github.com/users/SEGrooms/gists{/gist_id}","starred_url":"https://api.github.com/users/SEGrooms/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/SEGrooms/subscriptions","organizations_url":"https://api.github.com/users/SEGrooms/orgs","repos_url":"https://api.github.com/users/SEGrooms/repos","events_url":"https://api.github.com/users/SEGrooms/events{/privacy}","received_events_url":"https://api.github.com/users/SEGrooms/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/FreeCodeCamp/hikes/labels/Math%20for%20Programmers","name":"Math for Programmers","color":"e11d21"}],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":2,"created_at":"2015-12-29T19:53:41Z","updated_at":"2016-02-27T18:36:25Z","closed_at":"2016-02-27T18:36:25Z","body":"This is my proposed script for the first video on discrete mathematics. It shows the distinction as to why we must use discrete mathematics versus all mathematics.\r\n*******************************************************************************************************************\r\nDiscrete mathematics is a type of mathematics that deals with discrete (finite) sets of elements rather than continuous sets. This is why discrete mathematics is fundamental for the field of computer science. Imagine trying to run a program that requires an infinite number of executions. It is obvious to say that the program would run forever, and that is precisely what happens when using continuous sets. In order to avoid this problem we approximate continuous sets with discrete sets.\r\n\r\nFor example, suppose we wish to draw the circumference of a perfect circle using a given program. Unfortunately, this is impossible! The circumference of a circle is a set of points equidistant from a fixed point (the center). This set is infinite, and therefore it would take forever for the program to run.\r\n\r\nNow everyone has observed circles on computers, so how are they produced? The simple answer is that they aren't perfect circles, but they are perfect enough. Instead of trying to plot all points on the circumference of a circle let us choose 5 points to approximate a circle **show pentagon within circle**. Now, this obviously doesn't look like a circle, but if we increase the number of side of our 5-sided polygon (pentagon), to six it becomes a little closer to a circle. If we increase to seven it becomes a little more close. In fact, if we infinitely increase the number of sides of our regular polygon, the polygon becomes a circle. But, we already established this was impossible to print. So, we will simply increase the number of sides of our polygon until the differences become indistinguishable to the naked eye.\r\n******************************************************************************************************************\r\nQuestions:\r\n- Can a computer run a truely continuous function? (N)\r\n- Can a computer draw a circle? (N)\r\n- Can a computer approximate a circle? (Y)"}}