Finding Perfect Squares of n Factored as a^4*b^3*c^7

  • Thread starter Thread starter shravan
  • Start date Start date
  • Tags Tags
    Squares
shravan
Messages
16
Reaction score
0
a number n when factorised can be written as a^4*b^3*c^7.find number of perfect square which are factors of n.a,b,c are prime >2.
I have no idea how to start? please help.
 
Physics news on Phys.org
If a, b and c are distinct primes then numbers like a^2 are perfect squares and factors of n. There are 2 possible perfect squares arising from a, only 1 from b but 3 possibilities from c so the question is how many combinations are possible with those perfect squares?
 
Tide, how dare you miss such easy things? 3 possible perfect squares from a, 2 possible perfect squares from b and 4 possiblities from c of which in total three are same. You have missed the 0th power. Now the answer is 3*2*4. However during the combination of 2, 1 and 3 we won't get 1. Now the answer 3*2*4 is because for each 3 powers of a, there are two possible powers of b and for each of b there are 4 possibilities of c when each square is taken as the product of powers of each primes.
 
vaishakh,

No, I didn't miss the zero power. I had to leave something for the student to think about!
 
##\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...
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