Mobius Function, Euler Function and Carmicheal's Conjecture
Not what you're looking for?
1) Prove that in is a positive integer. ( : is the Mobius function)
Hint: one of the four argument is divisible by 4.
2) If is a prime and . Show that ( : is the Euler function)
3) a. Prove that is an integer if n is a prime and that it is not an integer
b. Prove that is not an integer if n is divisible by the square of a prime.
4) Prove Carmichael's conjecture for each ( mod 4)
(Carmichael conjectured that for each integer n, there exists an integer m n such that (n) = (m)
( : is the Euler function)
Please see the attached file for the fully formatted problems.
Purchase this Solution
Solution Summary
Mobius functions, euler functions and Carmicheal's conjecture are investigated. The solution is detailed and well presented.
Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations
Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.