 |
| |
|  by: rae - 2008-09-15 15:34:23 |
|
| | A short introduction to Turing's proof of the undecidability of Halting, meant for the novice computer science student or programmer. |
|
| |
| |
|
| |
| |
| | This article will show you some mathematical oddities that I find very interesting and curious. |
|
| |
| |
|
| |
| | by: ne0 - 2006-07-17 23:42:12 |
|
| | I came back to this site after a long long time and I noticed an article which shows how to compute primes more efficiently, that was exactly the method I used earlier but for numbers with more than 7 0s it got too slow.With some research (i.e googling) I found the algorithm that might be closest to the most efficient algorithm to prime number computation(w.r.t time not space) but I think we can sacrifice some extra megs for speed. |
|
| |
| |
|
| |
| |
| | A look at how to approximate transcendental and trigonometric functions using calculus. |
|
| |
| |
|
| |
| | by: anilg - 2006-05-10 23:41:56 |
|
| | Its an old branch (a twig, rather) of arithmetic. Read through and be facinated by the Magic Squares! |
|
| |
| |
|
| |
| |
| | This article will give you some examples on how to calculate the Nth root of a number. Also, an iterative php NRoot function will be created to search roots of very big numbers. |
|
| |
| |
|
| |
| | by: niki - 2006-01-03 05:08:43 |
|
| Ever needed to calculate the Length of a line, but processing time is critical, or you just plain dont have a square root function?
|
|
| |
| |
|
| |
| |
| | In the renaissance, it was widely believed that the golden ratio was very aesthetic. It was found in the well proportioned human (by Da Vinci), architecture etc. Today, it isn't all that popular. Still, it pops up in places like the Fibonacci numbers and other areas of mathematics.. This makes it a very interesting string of mathematics to study. |
|
| |
| |
|
| |
| | by: TroPe - 2004-12-19 19:28:04 |
|
| There is a 12.9984778326738% chance you are reading this.
We will learn about some basic (to intermediate) probability methods. We will look at some rules of probability, as well as some pitfalls you should try to avoid.
Ever wonder what the odds were regarding a certain situation? Of course you have. Well, let's figure out how to calculate those odds!
There are a few exercises at the end of this article for you to apply what you have learned. I would love to see some of your solutions.
Article by TroPe and Quantris |
|
| |
| |
|
| |
| | by: liranr - 2003-12-22 16:36:39 |
|
| This article will try to explain how the computer (and the calculator) calculates the values of variety of functions, especially trigonometric functions and exponents.
For this purpose, I will introduce a mathematical tool called a Maclaurin Series.
Prerequisites for this article is a shallow understanding of calculus, especially of derivatives. |
|
| |
| |
|
| |
| |
| | Continuing my series on sorting algorithms, here's a description, and some sample code, for the selection sort. |
|
| |
| |
|
| |
| |
| | Our decimal number system is known as a positional number system, because the value of the number depends on the position of the digits. For example, the number 123 has a very different value than the number 321, although the same digits are used in both numbers. |
|
| |
| |
|
| |
| |
| | This is quite simple but it can be useful to know how computers can carry out equations. |
|
| |
| |
|
| |
| |
| | do you ever wonder how a computer calculates a square root?it's pretty simple, you just need to know how to multiply, divide, and subtract. |
|
| |
| |
|
| |
| |
| | This article will show/teach you a purely mathematical way of how to convert decimal to binary and back, using a really simple method that does not require powers (which in the case of an algorithm takes too much time). |
|
| |
| |
|
