Modulo arthmetic solve for x^N .

  • Thread starter Thread starter shadowhywind
  • Start date Start date
shadowhywind
Messages
1
Reaction score
0
Modulo arthmetic solve for x^N...

Hay all, I am stuck on a problem, and its driving me crazy. I have a problem, xN = a mod b. Where I have to solve for x. My first thought was use to Fermat's little theorem(if I have the name correct), however my b is not a prime, (neither is 'N' or 'a' for that fact). I can give the exact problem with numbers if needed, but thought it would be slightly easier with variables instead. Any tips on how I could start to solve this would be great. Any questions please ask.
 
Physics news on Phys.org


I believe there is no generic solution to this problem.
 


Giving the actual numbers would probably be best for this one.
 


Google nth power residue for lots of results (and references to specific number theory texts) regarding your question.

Petek
 


Chinese remainder theorem.
 


Hurkyl said:
Chinese remainder theorem.

Yes. Factor b, use Fermat, then CRT the results together.
 

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

How Do You Determine the Maximum Order of an Element Modulo n?
Replies
10
Views
8K
I Dfns group action & group, written in terms of the other
Replies
26
Views
386
A Structure of modulo-integer matrix group GL(r,Z(n))?
Replies
17
Views
6K
I Understanding the Results of gcd(x,n)
Replies
8
Views
2K
MHB How to Translate Univariate Newton's Approximation to Multidimensional Systems?
Replies
2
Views
1K
I Name of distance to nearest multiple of n function?
Replies
1
Views
1K
MHB Prove that CnXCm isomorphic to Cgcd(m,n)XClcm(m,n)
Replies
3
Views
2K
I Modulo and Modulus in math and computer programming
Replies
5
Views
3K
I Solving a complex linear system with parameters
Replies
11
Views
2K
Proving the Chinese Remainder Theorem for Reduced Residues Modulo mn
Replies
1
Views
2K

Hot Threads

Recent Insights

Back
Top