How Does an Element of a Finite Group Relate to Cryptology Theorems?

AI Thread Summary
The discussion centers on understanding a theorem related to finite groups in cryptology. A participant seeks clarification on the theorem's validity and its application in a cryptology class. Suggestions include applying Lagrange's theorem, which states that for a finite group G, any element raised to the group's order equals the identity. The conversation highlights the importance of both theoretical understanding and practical application in proving the theorem. Overall, the exchange emphasizes collaborative problem-solving in cryptology studies.
llauren84
Messages
44
Reaction score
0

Attachments

  • math.png
    math.png
    9.4 KB · Views: 464
Physics news on Phys.org
You might try applying Lagrange's theorem; that should set you in the right direction.
 
If G is a finite group with order |G| then for each element a \in G , a^{|G]} = I, the identity.

Are you asking how to write a proof of the theorem or for some intuitive indication why it is true?
 
LaGrange's theory helped thanks. Also, the rewritten form of the statement helped, so thanks both of you.
 
Last edited:
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Back
Top