Chapter 4: Problem 12
If \(n \in \mathbf{Z}^{+}\), prove that 57 divides \(7^{n+2}+8^{2 n+1}\).
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 4: Problem 12
If \(n \in \mathbf{Z}^{+}\), prove that 57 divides \(7^{n+2}+8^{2 n+1}\).
All the tools & learning materials you need for study success - in one app.
Get started for free
For any \(n \in \mathbf{Z}^{*}\), prove that \(n\) is a perfect square if and only if \(n\) has an odd number of positive divisors.
Let \(a, b, c \in \mathbf{Z}^{+}\)with \(\operatorname{gcd}(a, b)=1\). If \(a \mid c\) and \(b \mid c\), prove that \(a b \mid c\). Does the result hold if \(\operatorname{gcd}(a, b) \neq 1\) ?
If \(a, b \in \mathbf{Z}^{+}\), and both are odd, prove that \(2 \mid\left(a^{2}+b^{2}\right)\) but \(4 \backslash\left(a^{2}+b^{2}\right)\).
Let \(a, b \in \mathbf{Z}^{*}\) where \(a \geq b\). Prove that \(\operatorname{gcd}(a, b)=\operatorname{gcd}(a-b, b)\).
Let \(n \in \mathbf{Z}^{+}\)where \(n\) is odd and \(n\) is not divisible by 5 . Prove that there is a power of \(n\) whose units digit is 1 .
What do you think about this solution?
We value your feedback to improve our textbook solutions.