For p a given prime number, define the p-adic norm | * |p as follows on...

For p a given prime number, define the p-adic norm | * |p as follows on Q: Given q in Q, we can write it as a product q = (p^m)(a/b) with a,b integers which are not divisible by p, and m an integer which is uniquely determined by q (check that m is indeed uniquely determined by q). Then define |q|p = p^(-m).

Check that Q with distance dp(q1,q2) = |q1 - q2|p is a metric space (here q1-q2 just means the usual operation of subtraction in Q). Show moreover
that |q1 + q2|p <= max(|q1|p, |q2|p).

Expert Solution

first to see that it is a metric space,

$Now\ consider\ a,b,c\in Q. Let\ |a-b|_p=p^{-k} and |b-c|_p=p^{-j}.\\ Then,\ let\ m=min(k,j)\ so\ that\ p^m|(a-b) \ and\ p^m|(b-c) \Rightarrow p^m|(a-c) \because a-c=a-b+b-c. \\ Hence,\ the \highest\ power\ of\ p\, say\ it\ l, \such\ that\ p^l|(a-c) \ satisfies\ l\geq min(k,j). \Hence,\\ d_p(a,c)=|a-c|_p=p^{-l}\leq p^{-min(k,j)}=max(p^{-k},p^{-j})=max(|a-b|_p,max(|b-c|_p))\\ \leq |a-b|_p+|b-c|_p=d_p(a,b)+d_p(b,c)$

now for second part,

and we are done.

Colby Messinger answered 1 year ago

Given n ∈N and p prime number and consider the polynomial f (x) = xn (xn-2)+1-p...

Given n ∈N and p prime number and consider the polynomial f (x) = xn (xn-2)+1-p 1)Prove that f (x) is irreducible in Q [x] 2) If n = 1 and p = 3, find Q [x] / f (x)) 3) Show that indeed Q [x] / (f (x)) is a field in the previous paragraph PLEASE answer all subsections

2. (a) Let p be a prime. Determine the number of elements of order p in...

2. (a) Let p be a prime. Determine the number of elements of order p in Zp^2 ⊕ Zp^2 . (b) Determine the number of subgroups of of Zp^2 ⊕ Zp^2 which are isomorphic to Zp^2 .

Find a p-Sylow subgroup for each of the given groups, and prime p: a. In Z24...

Find a p-Sylow subgroup for each of the given groups, and prime p: a. In Z24 a 2-sylow subgroup b. In S4 a 2-sylow subgroup c. In A4 a 3-sylow subgroup

A number is a palindromic prime if it is a prime number as well as a...

A number is a palindromic prime if it is a prime number as well as a palindromic number (ie. it is the same number when the digits are reversed). For example, 10301 is a palindromic prime. Write a Python program to ask the user how many palindromic primes they would like to compute, and output the values with a maximum of 10 values per line. Your program should include the following functions: isPrime(number) - returns True or False isPalindrome(number) -...

Define the negative reciprocity norm. Does this norm apply more to those raised in the US...

Define the negative reciprocity norm. Does this norm apply more to those raised in the US South or North? Use the “culture of honor” experiment to support your argument. Make sure to describe the study and its results.

Let p and q be any two distinct prime numbers and define the relation a R...

Let p and q be any two distinct prime numbers and define the relation a R b on integers a,b by: a R b iff b-a is divisible by both p and q. For this relation R: Prove that R is an equivalence relation. you may use the following lemma: If p is prime and p|mn, then p|m or p|n. Indicate in your proof the step(s) for which you invoke this lemma.

Prime Number Determines if a number is prime or not I also need the algorithm and...

Prime Number Determines if a number is prime or not I also need the algorithm and pseudocode in java.

Use the method of exhaustion to prove the following statement: “For every prime number p between...

Use the method of exhaustion to prove the following statement: “For every prime number p between 30 and 58, 10 does not divide p − 9.” Prove that 0.17461461 . . . is rational (digits 461 in the fractional part are periodically repeated forever).

[PYTHON] Two natural number p,q are called coprime if there are no common prime factors in...

[PYTHON] Two natural number p,q are called coprime if there are no common prime factors in their prime factorization. E.g. 15 and 20 are not coprime because 5 is a common prime number in their prime factorization, while 20 and 9 are coprime. The Euler’s phi function, φ(n), counts the number of all natural numbers ≤ n which are coprime to n. E.g. φ(9) = 6, as all natural numbers ≤ 9 are 1,2,3,4,5,6,7,8,9. And out of these, the numbers...

A prime number (or prime) is a natural number greater than 1 that has no posítive...

A prime number (or prime) is a natural number greater than 1 that has no posítive divisors other than 1 and itself. Write a Python program which takes a set of positive numbers from the input and returns the sum of the prime numbers in the given set. The sequence will be ended with a negative number.

Question