Modular Arithmetic and Diophantine Equations

  • Thread starter Thread starter drewfstr314
  • Start date Start date
  • Tags Tags
    Arithmetic
drewfstr314
Messages
20
Reaction score
0
If one is solving a modular equation:

4k \equiv 1 \: (\text{mod } n)

with n even, known, for k, then one needs to find the inverse of 4 modulo n:

4x - 1 = nc
4x - nc = 1

But this only has solutions iif (4,n) = 2 (n is even, but not a multiple of 4), which doesn't divide 1, so there is no inverse of 4 modulo n. Does this mean that there isn't a k that satisfies the original equation?

Thanks!
 
Physics news on Phys.org
hi drewfstr314! :smile:

that's right :smile:

4k is even, and 1 (mod n) is odd (since n is even), so there's no solution …

what is worrying you about that? :confused:​
 

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

I Question on Primitive Roots and GCDs
Replies
2
Views
2K
I Dfns group action & group, written in terms of the other
Replies
26
Views
381
A Modular forms, dimension and basis confusion, weight mod 1
Replies
12
Views
2K
I Modulo and Modulus in math and computer programming
Replies
5
Views
3K
I Congruence Subgroups and Modular Forms Concept Questions
Replies
1
Views
2K
What is the remainder when the following sum is divided by 4?
Replies
7
Views
2K
Derive and Solve the Lane-Emden Equation for a Polytropic Gas Sphere
Replies
6
Views
2K
Definition of Finite Field: Addition and Multiplication Groups
Replies
1
Views
2K
Solve the simultaneous congruence modulo equation
Replies
3
Views
2K
Solving Modular Arithmetic Equations in Z5
Replies
6
Views
5K

Hot Threads

Recent Insights

Back
Top