Re: Finding the Fourier transform of discrete functions

*To*: mathgroup at smc.vnet.net*Subject*: [mg52607] Re: Finding the Fourier transform of discrete functions*From*: Peter Pein <petsie at arcor.de>*Date*: Sat, 4 Dec 2004 04:07:46 -0500 (EST)*References*: <cohi1d$1fh$1@smc.vnet.net> <200412011057.FAA19902@smc.vnet.net> <comgk7$7a2$1@smc.vnet.net> <copa52$pmk$1@smc.vnet.net>*Sender*: owner-wri-mathgroup at wolfram.com

Jens-Peer Kuska wrote: > Hi, > > and you think that 1<=x<12 is discret, and not a infinite number > of continuous values ?? Strange ! > > Regards > Jens > > "DrBob" <drbob at bigfoot.com> schrieb im Newsbeitrag > news:comgk7$7a2$1 at smc.vnet.net... > >>>>what is a "discrete function". >>>>if it is a function, the parameter is continuous and FourierTransform[] >>>>compute the transformation. >> >>A discrete function is a function with a discrete domain. >> >>For instance, this is a discrete function on the obvious domain: >> >>f[x_Integer]/;1<=x<=12 = Sin@x *^^^^^^^^* >>It is NOT the Sin function, for the simple reason that the domain of a >>function (in math or mathematica) is part of its definition. >> >>Bobby >>.... I think, it's his firm conviction that there are only 12 Integers x in the interval 1<=x<=12. ;-) -- Peter Pein 10245 Berlin

**References**:**Re: Finding the Fourier transform of discrete functions***From:*"Jens-Peer Kuska" <kuska@informatik.uni-leipzig.de>