MHB 412.0.10 ok so going with dot product with 07312400508

karush
Gold Member
MHB
Messages
3,240
Reaction score
5
Use the UPC scheme to determine the check digit for the number $07312400508$.

here is the example from the book
View attachment 8330
ok so going with dot product with 07312400508
\begin{align*}\displaystyle
&\quad (0731 2 4 0 0 5 0 8)\cdot(3,1,3,1,3,1,3,1,3)\\
&= 0\cdot3+7\cdot1
+3\cdot3+1\cdot1
+2\cdot3+4\cdot1
+0\cdot3+0\cdot1
+5\cdot3+0\cdot1
+8\cdot3 \\
&=7+9+1+6+4+15+24\\
&=66\\
66mod10&=6
\end{align*}

so far?? but the number only has 11 digits
 
Last edited:
Physics news on Phys.org
karush said:
ok so going with dot product with 07312400508
\begin{align*}\displaystyle
&\quad (0731 2 4 0 0 5 0 8)\cdot(3,1,3,1,3,1,3,1,3)\\
&= 0\cdot3+7\cdot1
+3\cdot3+1\cdot1
+2\cdot3+4\cdot1
+0\cdot3+0\cdot1
+5\cdot3+0\cdot1
+8\cdot3 \\
&=7+9+1+6+4+15+24\\
&=66\\
66\pmod{10}&=6
\end{align*}

so far?? but the number only has 11 digits
That is correct so far. You now have to add a twelfth digit so as to make the checksum zero$\pmod{10}$.
 
Opalg said:
That is correct so far. You now have to add a twelfth digit so as to make the checksum zero$\pmod{10}$.
What would be the 12th digit?
 
karush said:
What would be the 12th digit?
What do you have to add to 66 to get a multiple of 10?
 
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...

Similar threads

Back
Top