Solving for c: One Solution in (0,1)?

  • Thread starter Thread starter martint
  • Start date Start date
AI Thread Summary
The discussion focuses on solving the equation c = (n/pi) arccos[(n/pi)sin(pi/n)] + 2k(pi) for c within the interval (0,1), where n is a positive integer. Participants suggest starting with specific integer values for n to understand the behavior of the function, but acknowledge that this approach won't provide a complete proof. The challenge lies in demonstrating that there is precisely one solution for c in the specified range. There is skepticism about using induction or contradiction, indicating that a theorem may be necessary for a rigorous proof. The conversation highlights the complexity of proving the uniqueness of the solution within the interval.
martint
Messages
9
Reaction score
0
Hello,

I've been trying to solve the following but with no luck its so frustrating!

if c= (n/pi) arccos [(n/pi)sin(pi/n)] + 2k(pi), where n is a positive integer,

how can I show that c has precisely one solution in (0,1)?

Thanks!
 
Mathematics news on Phys.org
What have you done to try and solve it?

Perhaps you can start by plugging in some positive integers for n...
 
that won't be a complete proof tho, need to show it holds for all values of n. Have tried breaking it down and looking at the limits of certain parts within the function, e.g sin (pi/n) lies between 0 and 1 for all n etc but this doesn't seem to get me anywhere as I get stuck when i reach the (n/pi) in front of the arccos!
 
martint said:
that won't be a complete proof tho, need to show it holds for all values of n. Have tried breaking it down and looking at the limits of certain parts within the function, e.g sin (pi/n) lies between 0 and 1 for all n etc but this doesn't seem to get me anywhere as I get stuck when i reach the (n/pi) in front of the arccos!

You are right, it won't be a complete proof. But by trying and working out the first few integer values, you will have a better understanding as to why it will always be between 0 and 1. Then perhaps you can produce a proof by induction.
 
i know that it lies between 0 and 1, but it is trying to show that there is only ONE solution between 0 and 1 that i haven't been able to achieve.I don't think it is possible by induction or contradiction but that a theorem or consequences of a theorem is required :confused:
 
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top