Question

Prove that if n is composite then 2^(n-1) is composite. (Please make this proof sound as...

Prove that if n is composite then 2^(n-1) is composite.

(Please make this proof sound as simple as possible so I can understand. )

0 0
Add a comment Improve this question Transcribed image text
Answer #1

ao com poste Compost e number- made i othes whele hum bera Gome integes amdl 0o k both exceedi 2 K-3 + 1 6- 2 The ohe doho Su

Add a comment
Know the answer?
Add Answer to:
Prove that if n is composite then 2^(n-1) is composite. (Please make this proof sound as...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT