|
|Store|
|
|
|
|
|
|
|
|
CTK Exchange
Sheniqua
guest
|
Jan-29-05, 01:18 AM (EST) |
|
|
"divisibility proofs"
| |
Hi I would really appreciate it if you could help me. I really do not know what to do for this question: Show that 2^(n-1) divides n! if and only if n is a power of 2. Please help me. Thanks!
|
|
|
Alert | IP |
Printer-friendly page |
Reply |
Reply With Quote | Top |
|
|
alexb
Charter Member
1420 posts |
Jan-29-05, 01:20 AM (EST) |
    |
1. "RE: divisibility proofs"
In response to message #0
| |
Try several small n and see if you can see the pattern. What power of 2 divides 2!, 3!, 4!, ..., 8!, 9!, ... ? Or you can count how many numbers below n are divisible by 2, then by 4, by 8, etc. |
|
|
Alert | IP |
Printer-friendly page |
Reply |
Reply With Quote | Top |
|
|
You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.
|Front page|
|Contents|
Copyright © 1996-2018 Alexander Bogomolny
71536239
|
|
Printer-friendly copy
Email this topic to a friend