Divisibility and Congruence problem

  • Thread starter Thread starter VeeEight
  • Start date Start date
  • Tags Tags
    Divisibility
VeeEight
Messages
615
Reaction score
0
I was trying to work out whether or not 2n+3 divides (2n+1)! for positive integers n. After trying a few cases I think it does not work but I don't know how a proof for this would work. I tried induction but it got really messy. I also tried rephrasing it, such as putting it into modular equation but have had no luck.

My other question is about a congruence. The statement is that (1-x)p-1 is congruent to 1 + x + ... + xp-2 + xp-1 modulo p where p is an odd prime. I tried to use the binomial theorem to prove this but couldn't finish it because it got really messy and also I have no experience in number theory. Any in understanding and working out these statements would be appreciated.
 
Physics news on Phys.org
If 2n+3 is prime, it cannot divide (2n+1)! If it is not a prime, it would - factor it into primes and powers of primes. All these factors will be < 2n+1.
 
Thanks I actually carried on with my work but thank you for the reply I will investigate it in a minute. And I solved the second question after reading up on fermat's little theorem so no more help is needed. Thank you.
 
In should have been obvious that 5 does not divide 3!= 6.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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...
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...
Back
Top