{"id":2995,"date":"2018-03-10T00:01:03","date_gmt":"2018-03-10T08:01:03","guid":{"rendered":"http:\/\/c-for-dummies.com\/blog\/?p=2995"},"modified":"2026-03-07T10:13:12","modified_gmt":"2026-03-07T18:13:12","slug":"day","status":"publish","type":"post","link":"https:\/\/c-for-dummies.com\/blog\/?p=2995","title":{"rendered":"π Day"},"content":{"rendered":"

Mathematic geeks of the world celebrate March 14 as “pi day.” The logic is that the date is 3\/14, which are the first three digits of the value π, or 3.14159….∞
\n
\nIf you really want to geek out, I can recommend a book, the History of Pi<\/em> by Petr Beckmann. I don’t consider myself a genius at math, but I enjoyed reading this book.<\/p>\n

\"\"

A History of π by Petr Beckmann<\/a><\/p><\/div>\n

Due to edicts from the Technology Writing Guild, I must state that π is defined as the ratio of a circle’s diameter to its circumference. The value represents the number of times you can wrap the diameter around the circle, and it’s constant for all circles. It’s also irrational, which means it makes absurd political arguments but it also cannot be expressed as a ratio of two integer values. Further, π is transcendental, which means it cannot be otherwise expressed by using algebra. The digits after the decimal in π never repeat.<\/p>\n

As you may guess, it’s possible to calculate the value of π by using a computer. The C language is one of the many tools you can use to do so. Before getting into the techniques, be aware that the value π is available as a constant defined in the math.h<\/code> header file, M_PI<\/code>. If you need to use π in your code, just include math.h<\/code> and use the M_PI<\/code> definition and you’re good.<\/p>\n

As far as calculating the value of π, different programmers have their own techniques. Each is based on one of the many odd methods by which the Mentats and Vulcans calculate π. The method I chose to emulate in my code is called a generalized continuing fraction<\/em>, illustrated in Figure 1.<\/p>\n

\"\"

Figure 1. One of the weird cascading fraction things used to calculate the value of π.<\/p><\/div>\n

If you look at the calculation, you see that the numbers cascade in a neat pattern: The numerator is 1, 2, 3, 4 squared and so on. The denominator is 1, 3, 5, 7, 9, and so on.<\/p>\n

While the fraction shown in Figure 1 is terrifying, it screams out “recursion!” to me. Having a fraction where the denominator keeps spiraling down and down is the same concept as recursion<\/a> in a programming language. That, combined with the nifty manner in which the numbers increment, implies that you can craft C language code to calculate the value of π — which is what I did.<\/p>\n

The code shown below is my attempt to emulate the continuing fraction (Figure 1) by using recursion in C. The recursive function is p()<\/em>, which uses two float variables, a<\/code> and b<\/code>: a<\/code> is the left-side, odd-number values shown in Figure 1; b<\/code> is the right “squared” value.<\/p>\n

\r\n#include <stdio.h>\r\n\r\nfloat p(float a,float b)\r\n{\r\n    return((b<100.0)?a+(b*b\/p(a+2.0,b+1.0)):b*b);\r\n}\r\n\r\nint main()\r\n{\r\n    printf(\"%.7f\\n\",4.0\/p(1.0,1.0));\r\n    return(0);\r\n}<\/pre>\n
The equation starts with 4.0 at Line 10, inside the printf()<\/em> statement. Values 1.0 and 1.0 are then sent to p()<\/em>.<\/p>\n
Within p()<\/em>, the return()<\/em> statement handles the recursive return condition and the division calculation. The return condition is b<100<\/code>. So the recursion continues as long as value b<\/code> (on the top in the cascading fraction) is less than 100. Otherwise, the fraction is expressed by using this equation:<\/p>\n
a+(b*b\/p(a+2.0,b+1.0))<\/code><\/p>\n
Here you see the value a<\/code>, b2<\/sup><\/code> and then the bottom part of the fraction is the recursion, calling the p()<\/em> function again, but with new values: a<\/code> increased by 2 and b<\/code> increased by 1.<\/p>\n
Here’s the output:<\/p>\n
3.1415925<\/code><\/p>\n
It’s accurate out to six digits. (The constant M_PI<\/code> is equal to 3.14159265358979323846264338327950288.) That’s about as good as you can get with this code. You can mess with the recursion exit condition, b<100<\/code>, though eventually recursion is going to overflow the stack.<\/p>\n
The internet is brimming with various other examples of calculating π. And I know research teams at universities are constantly searching for that elusive “final digit.” It’s fun and distracting.<\/p>\n
Enjoy π day!<\/p>\n","protected":false},"excerpt":{"rendered":"
It’s not quite pi day, but here on the C blog, I’m always willing to write a π-relevant Lesson. Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-2995","post","type-post","status-publish","format-standard","hentry","category-main"],"_links":{"self":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/2995","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2995"}],"version-history":[{"count":8,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/2995\/revisions"}],"predecessor-version":[{"id":7474,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/2995\/revisions\/7474"}],"wp:attachment":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2995"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2995"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2995"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}