Are 2^((n-2)/2) - 1 and 2^(2n) + 1 Relatively Prime?

  • Thread starter Thread starter Naveenks
  • Start date Start date
  • Tags Tags
    Prime Proof
Naveenks
Messages
2
Reaction score
0
Hi, Can anyone help me how to prove that the two numbers 2^((n-2)/2) -1, 2^(2n) + 1 are relatively prime?
Thanks.
 
Physics news on Phys.org
Hi, Naveenks,
check the question again; if n is odd, the first number is not an integer.

Besides, when n=18, the first number would be 2^8-1 = 255, and the second 2^36+1, and both are divisible by 17.
 
Thanks Dodo...I got it that the two numbers are not relatively prime for all values of n...
 

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

MHB 412.00.1.12 are relatively prime for all n.
Replies
1
Views
1K
I How to Prove a Congruence Relation for Prime Numbers?
Replies
17
Views
2K
I Localising a non integral domain at a prime
Replies
17
Views
1K
I Trouble understanding an online solution to an exercise in Dummit & Foote
Replies
18
Views
663
I Frequency of prime number gaps according to (p-1)/(p-2)
Replies
2
Views
1K
I Fundamental theorem of arithmetic from Jordan-Hölder theorem
Replies
5
Views
2K
I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
Replies
48
Views
3K
Every integer greater than 5 is the sum of three primes?
Replies
4
Views
3K
Determine (with proof) the set of all prime numbers
Replies
3
Views
2K
Show that 13 is the largest prime that can divide....
Replies
7
Views
2K

Hot Threads

Recent Insights

Back
Top