Proving Cauchy Sequences with Totient Theorem

Click For Summary
To prove that the sequence a_n = a^{p^n} is Cauchy in \mathbb{Q}_p when p does not divide a, it is essential to show that the difference a^{p^{n+k}} - a^{p^n} becomes divisible by increasingly larger powers of p. The factorization a^{p^{n+k}} - a^{p^n} = a^{p^n}(a^{p^{n+k}-1} - 1) is crucial, as a^{p^n} is not divisible by p. The challenge lies in demonstrating that a^{p^{n+k}-1} - 1 is divisible by higher powers of p as n and k increase. Utilizing the properties of the totient theorem may provide the necessary insight to establish this divisibility. The discussion highlights the connection between Cauchy sequences and number theory through the totient theorem.
Dragonfall
Messages
1,023
Reaction score
5

Homework Statement



If p does not divide a, show that a_n=a^{p^{n}} is Cauchy in \mathbb{Q}_p.

The Attempt at a Solution



We can factor a^{p^{n+k}}-a^{p^n}=a^{p^n}(a^{p^{n+k}-1}-1). p doesn't divide a^{p^n} so somehow I must show that a^{p^{n+k}-1}-1 is divisible by larger and larger powers of p. I feel it has something to do with the totient theorem, but I can't get it to work.
 
Last edited:
Physics news on Phys.org
Anyone help?
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 28 ·
Replies
28
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K