MHB How Can I Solve a Problem Using Euler's Totient Function for Odd Prime Numbers?

  • Thread starter Thread starter goody1
  • Start date Start date
  • Tags Tags
    Function
AI Thread Summary
To solve problems using Euler's Totient Function for odd prime numbers, it's essential to understand its definition and application. The discussion begins by examining specific examples, such as $\varphi(5)$, $\varphi(7)$, and $\varphi(11)$, to identify a general rule. For any odd prime number \( n \), the value of \( \varphi(n) \) represents the count of integers less than \( n \) that are coprime to \( n \). This foundational understanding is crucial for tackling more complex problems involving odd primes. Engaging with these examples helps clarify the function's properties and its implications.
goody1
Messages
16
Reaction score
0
Hello everyone, can anybody help me with this problem?

pic.png


The solution is for all odd prime numbers, but I have no idea how to solve it.
Any help will be greatly appreciated.
 
Physics news on Phys.org
Hi goody,

Let's take this one step at a time by first looking at the right hand side, then the left hand side for odd primes. We will worry about the non-odd prime case later.

Let's think of some examples first. What is the value of $\varphi(5)$? How about $\varphi(7)$ and $\varphi(11)$? Can you see a general rule emerging from these examples? Now, if $n$ is an odd prime, what should the value of $\varphi(n)$ be? In other words, how many numbers less than $n$ do not share a common divisor with $n$?
 

Thread 'Value of intuitionistic logic'

I'm taking a look at intuitionistic propositional logic (IPL). Basically it exclude Double Negation Elimination (DNE) from the set of axiom schemas replacing it with Ex falso quodlibet: ⊥ → p for any proposition p (including both atomic and composite propositions). In IPL, for instance, the Law of Excluded Middle (LEM) p ∨ ¬p is no longer a theorem. My question: aside from the logic formal perspective, is IPL supposed to model/address some specific "kind of world" ? Thanks.
View full post »

Thread 'Formal derivation of statement from Peano Arithmetic system'

I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
View full post »

Similar threads

I What is the probability that the product of the digits is odd?
Replies
13
Views
2K
B Are All Imaginable Integer Series Necessarily Infinite?
Replies
17
Views
2K
A Is it required to use the Reimann function to solve the problem?
Replies
8
Views
1K
MHB A Subset of a Graph with No Perfect Matching
Replies
1
Views
2K
A Number of unequal integers with sum S
Replies
12
Views
2K
Can 4 distinct prime numbers be related in such a way?
Replies
14
Views
3K
I Number of Integers (<N) divisible only by one power of 2
Replies
6
Views
1K
I Difference between relative risk and odds ratio
Replies
7
Views
3K
Exercise on (ir)rational numbers
Replies
1
Views
1K
MHB Next set of prime birthdays for three brothers
Replies
3
Views
2K

Hot Threads

Recent Insights

Back
Top