Proving Finite Solutions of phi(x)=n for Fixed Integer n

  • Thread starter Thread starter b0mb0nika
  • Start date Start date
  • Tags Tags
    Finite Integer
b0mb0nika
Messages
36
Reaction score
0
for n- fixed integer prove that
phi(x)=n has a finite number of solutions
I looked at 2 cases when x is even and when x is odd
1) if x is even then phi(2x)>phi(x) and I showed why it has a finite number of solutions
2) I'm not sure how to show for the case when x is odd.. any ideas?

thanks :)
 
Physics news on Phys.org
You don't need to split into even/odd. Have you seen the inequality \phi(x)\geq \sqrt{x}? (valid if x is not 2 or 6). This isn't too difficult to show and gives a bound on the number of x's for a given n. Though if you have the even case already, you could prove the above inequality is always true for odd x.


You could also use the fact that phi is multiplicative. Show that there are a finite number of primes p that will satisfy \phi(p)\leq n. For each of these primes there is a finite number of exponents k that will satisfy \phi(p^k)\leq n. Conclude there are finitely many x with \phi(x)\leq n.
 
i think i got it.. i proved it using the fact that it's multiplicative thanks :smile:
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I Dfns group action & group, written in terms of the other
Replies
26
Views
386
I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
Replies
48
Views
3K
I Question about "A Group Epimorphism is Surjective"
Replies
13
Views
586
I Proving inequality about dimension of quotient vector spaces
Replies
25
Views
3K
MHB What Is the Upper Bound of Groups of Order in Finite Group Theory?
Replies
2
Views
2K
I Showing ##k[x_1,\ldots,x_n]/\mathfrak{a}## is finite dimensional
Replies
40
Views
2K
I Number of Binary Operations on a Set with a Special Property
Replies
2
Views
3K
I Prove Even # Transpositions in Identity Permutation w/ Induction & Contradiction
Replies
8
Views
4K
I Prove that elements of x^i 0<i<n-1 are distinct
Replies
3
Views
1K
I Finding a polynomial that has solution (root) as the sum of roots
Replies
13
Views
2K

Hot Threads

Recent Insights

Back
Top