Prove that ## 13 ## divides ## 10^{2p}-10^{p}+1 ##

  • Thread starter Math100
  • Start date
In summary, for any prime number greater than 3, it can be expressed as either 6k+1 or 6k+5 for some integer k. By considering two cases, it can be shown that 13 divides 10^{2p}-10^{p}+1 for both cases, thus proving that 13 divides this expression for any prime number greater than 3.
  • #1
Math100
756
201
Homework Statement
For any prime ## p>3 ##, prove that ## 13 ## divides ## 10^{2p}-10^{p}+1 ##.
Relevant Equations
None.
Proof:

Let ## p>3 ## be any prime number.
Then ## p>3 ## is either of the form ## 6k+1 ## or ## 6k+5 ## for some ## k\in\mathbb{Z} ##.
Now we consider two cases.
Case #1: Suppose ## p=6k+1 ## for some ## k\in\mathbb{Z} ##.
Then ## 10^{2p}-10^{p}+1=10^{12k+2}-10^{6k+1}+1 ##.
Observe that
\begin{align*}
&10^{2p}-10^{p}+1\equiv [(-3)^{12k+2}-(-3)^{6k+1}+1]\pmod {13}\\
&\equiv [9((-3)^{3})^{4k}\cdot 3((-3)^{3})^{2k}+1]\pmod {13}\\
&\equiv [9(-1)^{4k}\cdot 3(-1)^{2k}+1]\pmod {13}\\
&\equiv (9+3+1)\pmod {13}\\
&\equiv 0\pmod {13}.\\
\end{align*}
Thus, ## 13\mid (10^{2p}-10^{p}+1) ##.
Case #2: Suppose ## p=6k+5 ## for some ## k\in\mathbb{Z} ##.
Then ## 10^{2p}-10^{p}+1=10^{12k+10}-10^{6k+5}+1 ##.
Observe that
\begin{align*}
&10^{2p}-10^{p}+1\equiv [(-3)^{12k+10}-(-3)^{6k+5}+1]\pmod {13}\\
&\equiv [-3((-3)^{3})^{4k+3}\cdot (-9)((-3)^{3})^{2k+1}+1]\pmod {13}\\
&\equiv [-3(-1)^{4k+3}\cdot (-9)(-1)^{2k+1}+1]\pmod {13}\\
&\equiv (3+9+1)\pmod {13}\\
&\equiv 0\pmod {13}.\\
\end{align*}
Thus, ## 13\mid (10^{2p}-10^{p}+1) ##.
Therefore, ## 13 ## divides ## 10^{2p}-10^{p}+1 ## for any prime ## p>3 ##.
 
  • Like
Likes fresh_42
Physics news on Phys.org
  • #2
Math100 said:
Homework Statement:: For any prime ## p>3 ##, prove that ## 13 ## divides ## 10^{2p}-10^{p}+1 ##.
Relevant Equations:: None.

Proof:

Let ## p>3 ## be any prime number.
Then ## p>3 ## is either of the form ## 6k+1 ## or ## 6k+5 ## for some ## k\in\mathbb{Z} ##.
Now we consider two cases.
Case #1: Suppose ## p=6k+1 ## for some ## k\in\mathbb{Z} ##.
Then ## 10^{2p}-10^{p}+1=10^{12k+2}-10^{6k+1}+1 ##.
Observe that
\begin{align*}
&10^{2p}-10^{p}+1\equiv [(-3)^{12k+2}-(-3)^{6k+1}+1]\pmod {13}\\
&\equiv [9((-3)^{3})^{4k}\cdot 3((-3)^{3})^{2k}+1]\pmod {13}\\
&\equiv [9(-1)^{4k}\cdot 3(-1)^{2k}+1]\pmod {13}\\
&\equiv (9+3+1)\pmod {13}\\
&\equiv 0\pmod {13}.\\
\end{align*}
Thus, ## 13\mid (10^{2p}-10^{p}+1) ##.
Correct, except that your \cdot should be +.
Math100 said:
Case #2: Suppose ## p=6k+5 ## for some ## k\in\mathbb{Z} ##.
Then ## 10^{2p}-10^{p}+1=10^{12k+10}-10^{6k+5}+1 ##.
Observe that
\begin{align*}
&10^{2p}-10^{p}+1\equiv [(-3)^{12k+10}-(-3)^{6k+5}+1]\pmod {13}\\
&\equiv [-3((-3)^{3})^{4k+3}\cdot (-9)((-3)^{3})^{2k+1}+1]\pmod {13}\\
&\equiv [-3(-1)^{4k+3}\cdot (-9)(-1)^{2k+1}+1]\pmod {13}\\
&\equiv (3+9+1)\pmod {13}\\
&\equiv 0\pmod {13}.\\
\end{align*}
Thus, ## 13\mid (10^{2p}-10^{p}+1) ##.
Same as above, \cdot should be +, but otherwise correct.
Math100 said:
Therefore, ## 13 ## divides ## 10^{2p}-10^{p}+1 ## for any prime ## p>3 ##.
 
  • Like
Likes Math100

What is the problem statement?

The problem statement is to prove that 13 divides 10 to the power of 2p minus 10 to the power of p plus 1.

What is the significance of 13 in this problem?

The number 13 is significant because it is the divisor that needs to divide the expression evenly in order for it to be proven.

What is the approach to solving this problem?

The approach to solving this problem is to use mathematical induction, where we first prove that the statement is true for a base case (p=1) and then show that if the statement is true for some value of p, it is also true for the next value of p (p+1).

What is the role of mathematical induction in this problem?

Mathematical induction is used to prove that the statement holds true for all values of p. By proving the base case and the inductive step, we can show that the statement is true for p=1, p=2, p=3, and so on, thereby proving it for all positive integers.

Why is it important to prove that 13 divides the expression?

It is important to prove that 13 divides the expression because it is a fundamental property of divisibility and it helps us understand the relationship between the numbers involved. Additionally, proving this statement can also lead to the discovery of other interesting mathematical properties and patterns.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
3
Views
852
  • Precalculus Mathematics Homework Help
Replies
6
Views
827
  • Precalculus Mathematics Homework Help
Replies
14
Views
1K
  • Precalculus Mathematics Homework Help
Replies
2
Views
629
  • Precalculus Mathematics Homework Help
Replies
14
Views
1K
  • Precalculus Mathematics Homework Help
Replies
7
Views
823
  • Precalculus Mathematics Homework Help
Replies
1
Views
850
  • Precalculus Mathematics Homework Help
Replies
2
Views
683
  • Precalculus Mathematics Homework Help
Replies
6
Views
1K
  • Precalculus Mathematics Homework Help
Replies
7
Views
1K
Back
Top