A community for students.
Here's the question you clicked on:
← 55 members online
 0 viewing
anonymous
 3 years ago
prove 7 divides 2n1 = 3divides n
anonymous
 3 years ago
prove 7 divides 2n1 = 3divides n

This Question is Closed

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0Prove tht \[\forall n \in \mathbb{N} , 7(2^n1) <=> 3n\]

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0a hint is to look at the multiplication table (for \[\mathbb{Z}/7\mathbb{Z}\] and computer powers of 2 mod 7, and to notice how they repeat

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.0dw:1352059720286:dw

anonymous
 3 years ago
Best ResponseYou've already chosen the best response.01. it is not a proof 2. 3 divides n means n/3 not 3/n :p
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.