summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorsiveshs <siveshs@gmail.com>2010-07-02 03:05:58 +0000
committerbnewbold <bnewbold@adelie.robocracy.org>2010-07-02 03:05:58 +0000
commitcb1936ea71b87f878a757cec38009f73766526d2 (patch)
tree3eca78e64e44a9634b27f1ae7e0fe81011671b6b
parent32c0eb851196794209d1f2750affe869def0f2e1 (diff)
downloadafterklein-wiki-cb1936ea71b87f878a757cec38009f73766526d2.tar.gz
afterklein-wiki-cb1936ea71b87f878a757cec38009f73766526d2.zip
checking again
-rw-r--r--Fourier Series.page4
1 files changed, 2 insertions, 2 deletions
diff --git a/Fourier Series.page b/Fourier Series.page
index eab8daf..44c3ee4 100644
--- a/Fourier Series.page
+++ b/Fourier Series.page
@@ -5,8 +5,8 @@
We first begin with a few basic identities on the size of sets. Show that the set of possible functions representing sets is not larger than the set of available functions?
##Why Fourier series is plausible?</b>
-To show that Fourier series is plausible, let us consider some fairly random functions and see if it is possible to express them as the sum of sines and cosines: $x^2$
- $$1. \cos(2x) = 1 - 2 \sin^2(x)$$
+To show that Fourier series is plausible, let us consider some fairly random functions and see if it is possible to express them as the sum of sines and cosines:
+ $1. \cos(2x) = 1 - 2 \sin^2(x)$
##What is the Fourier series actually?</b>