mod
  • Member for 6 years, 1 month
  • Last seen more than 5 years ago
Elementary theory of numbers and congruences
1 votes

HINT: First use Euler's criterion to make sure that they have solutions. Euler's criterion is a formula for determining whether an integer is a quadratic residue modulo a prime. Precisely, Let $p$ be ...

View answer
Solve the following equations for $x, (x ∈ N^+) (a)\ 2φ(x) = x; (b)\ 3φ(x) = x; (c)\ 4φ(x) = x.$
Accepted answer
0 votes

$(a) 2φ(x)=x$ $x = 2^2$ $φ(x)=2^1*(2-1)=2$ $2φ(x)=2*2=2^2=x \Rightarrow 2φ(x)=x$ $(b) 3φ(x)=x$ $x=2*3^3=54$ $φ(x)=φ(2*3^3)=φ(2)φ(3^3)=18$ $3φ(x)=3*18=54=x \Rightarrow 3φ(x)=x$ $(c) 4φ(x)=x$ ...

View answer