Re: Simple, but a bit hard, Trigonometry problem.
- From: gtsavdar@xxxxxxxxx
- Date: 24 May 2007 07:46:40 -0700
/ Phil Carmody :
quasi <quasi@xxxxxxxx> writes:Then the gcd(rs,t)=1 would be false, so the statement "Let r,s,t be
Conjecture 1:
Let r,s,t be integers such that gcd(rs,t)=1, and let a=sin(r),
b=sin(s), c=sin(t). Then c _cannot_ be expressed as a polynomial in
a,b.
What if t is 0?
integers such that gcd(rs,t)=1" would be false too, so the implication
would be true.
Now it remains to show this for t not 0....
I had 1 problem now i have 3:-( (the original, the polynomial thing
and the conjectures)
.
- Follow-Ups:
- Re: Simple, but a bit hard, Trigonometry problem.
- From: Phil Carmody
- Re: Simple, but a bit hard, Trigonometry problem.
- References:
- Simple, but a bit hard, Trigonometry problem.
- From: gtsavdar
- Re: Simple, but a bit hard, Trigonometry problem.
- From: quasi
- Re: Simple, but a bit hard, Trigonometry problem.
- From: quasi
- Re: Simple, but a bit hard, Trigonometry problem.
- From: quasi
- Re: Simple, but a bit hard, Trigonometry problem.
- From: Phil Carmody
- Simple, but a bit hard, Trigonometry problem.
- Prev by Date: Bassam's WAR AGAINST MATHEMATICIANS!
- Next by Date: Re: Fermat's Last theorem short proof
- Previous by thread: Re: Simple, but a bit hard, Trigonometry problem.
- Next by thread: Re: Simple, but a bit hard, Trigonometry problem.
- Index(es):