|
Register | Blogging | Today's Posts | Search |
|
Thread Tools | Display Modes |
04-22-2009, 08:47 AM | #1 (permalink) |
Unrepentant Ass-Mod
Join Date: Jun 2008
Location: Pennsylvania
Posts: 3,921
|
MORE MATH for you guys
here's my homework:
What is the Fourier series for the following system: y(II) + y = 0 y(0) = 0 y(pi) = 0 see if you can do it guys! i'll post answers later! lol, lock.
__________________
first.am |
04-22-2009, 08:54 AM | #3 (permalink) |
Account Disabled
Join Date: Feb 2009
Location: lorain,ohio
Posts: 909
|
*cough*
This list includes the squares of 3, 5, 7, 9, 13, 19, and 63.) These numbers are the result of a progressive sieve, analogous to the prime sieve. For example, every term greater than 10 must not be divisible by 2, because otherwise it would give an integer N for (3K-10)/2 based on the pair 1,-3. Likewise from the pair 2,-2 we see that every term greater than 8 must not be congruent to 2 modulo 3, because otherwise it would give an integer N for (4K-8)/3. Here is a short table of the expressions that must not be integers for sufficiently large "prime K" values -1 -2 -3 -4 -5 1 - (2K-5)/1 (3K-10)/2 ( 4K-17)/ 3 ( 5K-26)/ 4 2 (4K-8)/3 (6K-13)/5 ( 8K-20)/ 7 (10K-29)/ 9 3 (9K-18)/8 (12K-25)/11 (15K-34)/14 4 (16K-32)/15 (20K-41)/19 5 (25K-50)/24 In each case the expression (AK-B)/(A-1) implies that for K values greater than B we must exclude those such that K = B (mod A-1). In other words, the sieve excludes every number greater than q = x^2 + y^2 congruent to q mod (xy-1). *cough* |
04-22-2009, 08:57 AM | #5 (permalink) | |
Juicious Maximus III
Join Date: Nov 2008
Location: Scabb Island
Posts: 6,525
|
Quote:
__________________
Something Completely Different |
|
04-22-2009, 09:38 AM | #8 (permalink) |
Fish in the percolator!
Join Date: Dec 2005
Location: Hobbit Land NZ
Posts: 2,870
|
We've briefly covered Fourier transforms for modelling signals in computer networking, and I imagine I'll encounter them in more detail later on when doing graphical stuff. They're very useful.
And Cory, here's a nice challenge for you with a deceptively simple solution: Prove that any natural number can be written as 2^i * n where n is odd.
__________________
|
04-22-2009, 12:43 PM | #9 (permalink) |
Unrepentant Ass-Mod
Join Date: Jun 2008
Location: Pennsylvania
Posts: 3,921
|
nominal & ordinal differential equations. this concept is actually not that hard to grasp, basically transforms any function into a sine & cosine infinite series. it's still pretty hard to figure out what the series is, but that just goes back to calc II.
and Seltzer, aren't you a comp e major? i expect you'll have to get way more in depth than this. i'm only 12 credits away from a math minor myself, but i'm not exactly looking forward to statistical analysis (or whatever it's called over there). edit: dac you may not have to take this part. at my school some of the engineering majors only have to cover the first part of the course. likewise i didn't have to take all of calc III.
__________________
first.am |
04-22-2009, 12:45 PM | #10 (permalink) |
afrocentric
Join Date: Jan 2008
Location: texas
Posts: 753
|
wtf
__________________
i changed my mind; i changed my mind;now i'm feeling different all that time, wasted i wish i was a little more delicate i wish my i wish my i wish my i wish my i wish my name was clementine - sarah jaffe |
|