summaryrefslogtreecommitdiffstats
path: root/Fourier Series.page
diff options
context:
space:
mode:
authorsiveshs <siveshs@gmail.com>2010-07-03 05:06:47 +0000
committerbnewbold <bnewbold@adelie.robocracy.org>2010-07-03 05:06:47 +0000
commitbfc0110823cdbf40f8edaf2f2e88a9dfd6d8a4b8 (patch)
tree3230f264bb767a20ffb2d26b9a8677641dc42cd7 /Fourier Series.page
parentd36ea22536d73605f1c262ecd3f74966198cdd16 (diff)
downloadafterklein-wiki-bfc0110823cdbf40f8edaf2f2e88a9dfd6d8a4b8.tar.gz
afterklein-wiki-bfc0110823cdbf40f8edaf2f2e88a9dfd6d8a4b8.zip
some final changes
Diffstat (limited to 'Fourier Series.page')
-rw-r--r--Fourier Series.page2
1 files changed, 1 insertions, 1 deletions
diff --git a/Fourier Series.page b/Fourier Series.page
index cfea31b..cfc313e 100644
--- a/Fourier Series.page
+++ b/Fourier Series.page
@@ -1,4 +1,4 @@
-#<b>Why Fourier series possible?</b>
+#<b>Why Fourier series is possible?</b>
We first begin with a few basic identities on the size of sets. Then, we will show that the set of possible functions representing sets is not larger than the set of available functions. This at best indicates that the Fourier series is not altogether impossible.
## To show that $(0,1) \sim \mathbb R$