Re: How to prove it!
- From: Kira Yamato <kirakun@xxxxxxxxxxxxx>
- Date: Fri, 20 Oct 2006 07:25:40 GMT
"christopher" <wychan.chris@xxxxxxxxx> wrote:
Prove that for all positive integer n, n! cannot be written as k
squared for positive integer k. n>1
I think it should use mathematical induction!
Thanks
Can you use the fact that if p is a prime number, then there must be
another prime number q such that
p < q < 2q
?
-kira
.
- Follow-Ups:
- Re: How to prove it!
- From: bot
- Re: How to prove it!
- From: Proginoskes
- Re: How to prove it!
- References:
- How to prove it!
- From: christopher
- How to prove it!
- Prev by Date: Re: An uncountable countable set
- Next by Date: Re: Solutions of this polynomial (degree of 5)
- Previous by thread: How to prove it!
- Next by thread: Re: How to prove it!
- Index(es):