Question

Let phi(n) = integers from 1 to (n-1) that are relatively prime to n 1. Find...

Let phi(n) = integers from 1 to (n-1) that are relatively prime to n

1. Find phi(2^n)

2. Find phi(p^n)

3. Find phi(p•q) where p, q are distinct primes

4. Find phi(a•b) where a, b are relatively prime

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider all integers between 1 and pq where p and q are two distinct primes. We...
Consider all integers between 1 and pq where p and q are two distinct primes. We choose one of them, all with equal probability. a) What is the probability that we choose any given number? b) What is the probability that we choose a number that is i) relatively prime to p? ii) relatively prime to q? iii) relatively prime to pq?
Prove that n − 1 and 2n − 1 are relatively prime, for all integers n...
Prove that n − 1 and 2n − 1 are relatively prime, for all integers n > 1.
Prove the following statements: 1- If m and n are relatively prime, then for any x...
Prove the following statements: 1- If m and n are relatively prime, then for any x belongs, Z there are integers a; b such that x = am + bn 2- For every n belongs N, the number (n^3 + 2) is not divisible by 4.
Suppose n = rs where r and s are distinct primes, and let p be a...
Suppose n = rs where r and s are distinct primes, and let p be a prime. Determine (with proof, of course) the number of irreducible degree n monic polynomials in Fp[x]. (Hint: look at the proof for the number of prime degree polynomials) The notation Fp means the finite field with q elements
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
Let n ≥ 2. Define Gn to be the graph whose vertices are the integers 2,...
Let n ≥ 2. Define Gn to be the graph whose vertices are the integers 2, 3, . . . , n. Two vertices are adjacent if and only if the two corresponding numbers are relatively prime, that is, their gcd is 1. Find a particular k such that Gk is not planar. (It is not necessary to find the smallest k with this property.)
Prove: For all positive integers n, the numbers 7n+ 5 and 7n+ 12 are relatively prime.
Prove: For all positive integers n, the numbers 7n+ 5 and 7n+ 12 are relatively prime.
Definition: Let p be a prime and 0 < n then the p-exponent of n, denoted...
Definition: Let p be a prime and 0 < n then the p-exponent of n, denoted ε(n, p) is the largest number k such that pk | n. Note: for p does not divide n we have ε(n,p) = 0 Notation: Let n ∈ N+ we denote the set {p : p is prime and p | n} by Pr(n). Observe that Pr(n) ⊆ {2, 3, . . . n} so that Pr(n) is finite. Problem: Let a, b be...
: (a) Let p be a prime, and let G be a finite Abelian group. Show...
: (a) Let p be a prime, and let G be a finite Abelian group. Show that Gp = {x ∈ G | |x| is a power of p} is a subgroup of G. (For the identity, remember that 1 = p 0 is a power of p.) (b) Let p1, . . . , pn be pair-wise distinct primes, and let G be an Abelian group. Show that Gp1 , . . . , Gpn form direct sum in...
For each prime number p below, find all of the Gaussian primes q such that p...
For each prime number p below, find all of the Gaussian primes q such that p lies below q: 2 3 5 Then for each Gaussian prime q below, find the prime number p such that q lies above p: 1 + 4i 3i 2 + 3i
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT