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**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Modulo arithmetic (?) question

Loading...

Similar Threads - Modulo arithmetic question | Date |
---|---|

Using modulo 11 | Sep 15, 2014 |

A big number modulo a prime | Dec 12, 2012 |

Modulo and prime numbers | Nov 4, 2012 |

Negative modulo question | Jul 14, 2012 |

Cryptography - modulo arithmetic | Mar 12, 2011 |

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