![]() |
![]() |
#1 |
Dec 2005
22·23 Posts |
![]()
In my math classes, I tend to think of better methods of calculating things than the methods my teachers have shown me. When I have described my methods to math teachers, they said that someone else probably thought of them before I did, but whenever I read about math history, I find that people who came up with surprisingly simple things (like the child who came up with n2 = 2n1 - n0 + 2 for finding perfect squares) were the first to think about them, so today I figured that it might be worth a try to post on a math message board one of the formulas I have created and ask if anyone has done it before and whether or not it is useful.
My math teacher said that to find the number of intersections for sine and cosine curves in a given range, one should plot them, circle the intersections and then count them to find the answer. I did not like that method, so I came up with the formula f1 * f2 * (r / 2 Pi)^2 to calculate it. f1 is frequency one, f2 is frequency 2 and r is the range in radians. It only works when the result is an integer and the range is above a certain size; it has been a while so I cannot recall what the exact range was although I think that 2 Pi was the minimum. The formula is also expandable to utilize mutiple frequencies over mutiple ranges as (r / 2 Pi) is raised to the power of the number of frequencies, so it becomes possible to calculate the number of intersections between 4 sine and/or cosine curves with the derivative f1 * f2 * f3 * f4 * (r / 2 Pi)^4. In reflection, I must state that all curves must be unique such that you cannot have two sine or cosine curves with the same frequency. Has this been done before and is it useful? Last fiddled with by ShiningArcanine on 2006-07-29 at 04:00 Reason: Removed details concerning my current level of education; Clarifications |
![]() |
![]() |
![]() |
#2 |
Aug 2002
Buenos Aires, Argentina
144610 Posts |
![]()
You are trying to find:
in the range [0, 2*pi) Since (see for example http://aleph0.clarku.edu/~djoyce/jav...dentities.html ) we get: The number of zeros (counting multiplicity) is the sum of zeros of both sines. The number of zeros of the first sine is The number of zeros of the second sine is Adding them we have: For example, when the frequences are 7 and 5, the number of intersections in [0, 2*pi) is 14. |
![]() |
![]() |
![]() |
#3 |
Dec 2005
10111002 Posts |
![]()
I guess that it has been done before. Thanks for demonstrating that.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Number of curves needed? | jibanes | GMP-ECM | 3 | 2018-02-04 19:55 |
Number of ECM curves when getting assignments | houding | Software | 3 | 2014-04-11 02:15 |
A Study of Primes Through Non-Resonant Sine Waves | EdH | Math | 56 | 2010-04-11 19:47 |
Signs of Remainders of Cosine and Sine Series | jinydu | Homework Help | 2 | 2008-04-29 01:22 |
Hard proplem for finding sine function | tinhnho | Miscellaneous Math | 6 | 2005-01-17 05:42 |