Find all integers n>1 such that n is a power of 3, and n-1 is five times a power of 2.(adsbygoogle = window.adsbygoogle || []).push({});

Can anyone give me a push in the right direction?

**Physics Forums - The Fusion of Science and Community**

# Modulo arithmetic (?) question

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Modulo arithmetic (?) question

Loading...

**Physics Forums - The Fusion of Science and Community**