The number of $7×7$ matrices with specific conditions












2












$begingroup$


I am asked to find the number of $7×7$ matrices with entries $0,1,2,...,9$ whose determinant is not a multiple of $10$.



Expanding the determinant along rows (or columns) gives us a messy expression and, henceforth difficult to deal with.



Is it attackable using recurrences or we have to choose another approach? Please help me and give a hint to start with this problem.



Thank you.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Try to get an idea here.
    $endgroup$
    – metamorphy
    Dec 22 '18 at 10:47










  • $begingroup$
    The results in the linked page of wikipedia are for fileds $mathbb{Z}_p$ ( p is a prime). Can we generalize this results to fileds of order $pq$ ?
    $endgroup$
    – Fermat
    Dec 22 '18 at 11:24












  • $begingroup$
    I didn't mean it to be a ready-to-use answer. But OK, see mine below.
    $endgroup$
    – metamorphy
    Dec 22 '18 at 12:07
















2












$begingroup$


I am asked to find the number of $7×7$ matrices with entries $0,1,2,...,9$ whose determinant is not a multiple of $10$.



Expanding the determinant along rows (or columns) gives us a messy expression and, henceforth difficult to deal with.



Is it attackable using recurrences or we have to choose another approach? Please help me and give a hint to start with this problem.



Thank you.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Try to get an idea here.
    $endgroup$
    – metamorphy
    Dec 22 '18 at 10:47










  • $begingroup$
    The results in the linked page of wikipedia are for fileds $mathbb{Z}_p$ ( p is a prime). Can we generalize this results to fileds of order $pq$ ?
    $endgroup$
    – Fermat
    Dec 22 '18 at 11:24












  • $begingroup$
    I didn't mean it to be a ready-to-use answer. But OK, see mine below.
    $endgroup$
    – metamorphy
    Dec 22 '18 at 12:07














2












2








2


2



$begingroup$


I am asked to find the number of $7×7$ matrices with entries $0,1,2,...,9$ whose determinant is not a multiple of $10$.



Expanding the determinant along rows (or columns) gives us a messy expression and, henceforth difficult to deal with.



Is it attackable using recurrences or we have to choose another approach? Please help me and give a hint to start with this problem.



Thank you.










share|cite|improve this question











$endgroup$




I am asked to find the number of $7×7$ matrices with entries $0,1,2,...,9$ whose determinant is not a multiple of $10$.



Expanding the determinant along rows (or columns) gives us a messy expression and, henceforth difficult to deal with.



Is it attackable using recurrences or we have to choose another approach? Please help me and give a hint to start with this problem.



Thank you.







linear-algebra combinatorics matrices






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 22 '18 at 16:31







Fermat

















asked Dec 22 '18 at 10:33









FermatFermat

4,4351926




4,4351926












  • $begingroup$
    Try to get an idea here.
    $endgroup$
    – metamorphy
    Dec 22 '18 at 10:47










  • $begingroup$
    The results in the linked page of wikipedia are for fileds $mathbb{Z}_p$ ( p is a prime). Can we generalize this results to fileds of order $pq$ ?
    $endgroup$
    – Fermat
    Dec 22 '18 at 11:24












  • $begingroup$
    I didn't mean it to be a ready-to-use answer. But OK, see mine below.
    $endgroup$
    – metamorphy
    Dec 22 '18 at 12:07


















  • $begingroup$
    Try to get an idea here.
    $endgroup$
    – metamorphy
    Dec 22 '18 at 10:47










  • $begingroup$
    The results in the linked page of wikipedia are for fileds $mathbb{Z}_p$ ( p is a prime). Can we generalize this results to fileds of order $pq$ ?
    $endgroup$
    – Fermat
    Dec 22 '18 at 11:24












  • $begingroup$
    I didn't mean it to be a ready-to-use answer. But OK, see mine below.
    $endgroup$
    – metamorphy
    Dec 22 '18 at 12:07
















$begingroup$
Try to get an idea here.
$endgroup$
– metamorphy
Dec 22 '18 at 10:47




$begingroup$
Try to get an idea here.
$endgroup$
– metamorphy
Dec 22 '18 at 10:47












$begingroup$
The results in the linked page of wikipedia are for fileds $mathbb{Z}_p$ ( p is a prime). Can we generalize this results to fileds of order $pq$ ?
$endgroup$
– Fermat
Dec 22 '18 at 11:24






$begingroup$
The results in the linked page of wikipedia are for fileds $mathbb{Z}_p$ ( p is a prime). Can we generalize this results to fileds of order $pq$ ?
$endgroup$
– Fermat
Dec 22 '18 at 11:24














$begingroup$
I didn't mean it to be a ready-to-use answer. But OK, see mine below.
$endgroup$
– metamorphy
Dec 22 '18 at 12:07




$begingroup$
I didn't mean it to be a ready-to-use answer. But OK, see mine below.
$endgroup$
– metamorphy
Dec 22 '18 at 12:07










1 Answer
1






active

oldest

votes


















3












$begingroup$

Let $M_n(m)$ be the set of all $ntimes n$ matrices over $mathbb{Z}/mmathbb{Z}$, and let
$$Z_n(m)={Ain M_n(m) : det A=0}.$$
Chinese remainder theorem says that, for $m_1,m_2$ coprime, the map
$$Amapsto(Abmod m_1,Abmod m_2)$$
is a bijection between $M_n(m_1 m_2)$ and $M_n(m_1)times M_n(m_2)$, and also between $Z_n(m_1 m_2)$ and $Z_n(m_1)times Z_n(m_2)$. From the link given in the comment above, for prime $p$ we have
$$F(n,p):=#(M_n(p)setminus Z_n(p))=prod_{k=0}^{n-1}(p^n-p^k).$$
Thus the answer is $(pq)^{n^2}-big(p^{n^2}-F(n,p)big)big(q^{n^2}-F(n,q)big)$ for $n=7, p=2, q=5$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thank you for your detailed answer. +1
    $endgroup$
    – Fermat
    Dec 22 '18 at 15:16












Your Answer








StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3049292%2fthe-number-of-7%25c3%25977-matrices-with-specific-conditions%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









3












$begingroup$

Let $M_n(m)$ be the set of all $ntimes n$ matrices over $mathbb{Z}/mmathbb{Z}$, and let
$$Z_n(m)={Ain M_n(m) : det A=0}.$$
Chinese remainder theorem says that, for $m_1,m_2$ coprime, the map
$$Amapsto(Abmod m_1,Abmod m_2)$$
is a bijection between $M_n(m_1 m_2)$ and $M_n(m_1)times M_n(m_2)$, and also between $Z_n(m_1 m_2)$ and $Z_n(m_1)times Z_n(m_2)$. From the link given in the comment above, for prime $p$ we have
$$F(n,p):=#(M_n(p)setminus Z_n(p))=prod_{k=0}^{n-1}(p^n-p^k).$$
Thus the answer is $(pq)^{n^2}-big(p^{n^2}-F(n,p)big)big(q^{n^2}-F(n,q)big)$ for $n=7, p=2, q=5$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thank you for your detailed answer. +1
    $endgroup$
    – Fermat
    Dec 22 '18 at 15:16
















3












$begingroup$

Let $M_n(m)$ be the set of all $ntimes n$ matrices over $mathbb{Z}/mmathbb{Z}$, and let
$$Z_n(m)={Ain M_n(m) : det A=0}.$$
Chinese remainder theorem says that, for $m_1,m_2$ coprime, the map
$$Amapsto(Abmod m_1,Abmod m_2)$$
is a bijection between $M_n(m_1 m_2)$ and $M_n(m_1)times M_n(m_2)$, and also between $Z_n(m_1 m_2)$ and $Z_n(m_1)times Z_n(m_2)$. From the link given in the comment above, for prime $p$ we have
$$F(n,p):=#(M_n(p)setminus Z_n(p))=prod_{k=0}^{n-1}(p^n-p^k).$$
Thus the answer is $(pq)^{n^2}-big(p^{n^2}-F(n,p)big)big(q^{n^2}-F(n,q)big)$ for $n=7, p=2, q=5$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thank you for your detailed answer. +1
    $endgroup$
    – Fermat
    Dec 22 '18 at 15:16














3












3








3





$begingroup$

Let $M_n(m)$ be the set of all $ntimes n$ matrices over $mathbb{Z}/mmathbb{Z}$, and let
$$Z_n(m)={Ain M_n(m) : det A=0}.$$
Chinese remainder theorem says that, for $m_1,m_2$ coprime, the map
$$Amapsto(Abmod m_1,Abmod m_2)$$
is a bijection between $M_n(m_1 m_2)$ and $M_n(m_1)times M_n(m_2)$, and also between $Z_n(m_1 m_2)$ and $Z_n(m_1)times Z_n(m_2)$. From the link given in the comment above, for prime $p$ we have
$$F(n,p):=#(M_n(p)setminus Z_n(p))=prod_{k=0}^{n-1}(p^n-p^k).$$
Thus the answer is $(pq)^{n^2}-big(p^{n^2}-F(n,p)big)big(q^{n^2}-F(n,q)big)$ for $n=7, p=2, q=5$.






share|cite|improve this answer











$endgroup$



Let $M_n(m)$ be the set of all $ntimes n$ matrices over $mathbb{Z}/mmathbb{Z}$, and let
$$Z_n(m)={Ain M_n(m) : det A=0}.$$
Chinese remainder theorem says that, for $m_1,m_2$ coprime, the map
$$Amapsto(Abmod m_1,Abmod m_2)$$
is a bijection between $M_n(m_1 m_2)$ and $M_n(m_1)times M_n(m_2)$, and also between $Z_n(m_1 m_2)$ and $Z_n(m_1)times Z_n(m_2)$. From the link given in the comment above, for prime $p$ we have
$$F(n,p):=#(M_n(p)setminus Z_n(p))=prod_{k=0}^{n-1}(p^n-p^k).$$
Thus the answer is $(pq)^{n^2}-big(p^{n^2}-F(n,p)big)big(q^{n^2}-F(n,q)big)$ for $n=7, p=2, q=5$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 22 '18 at 12:19

























answered Dec 22 '18 at 12:02









metamorphymetamorphy

3,8721721




3,8721721












  • $begingroup$
    Thank you for your detailed answer. +1
    $endgroup$
    – Fermat
    Dec 22 '18 at 15:16


















  • $begingroup$
    Thank you for your detailed answer. +1
    $endgroup$
    – Fermat
    Dec 22 '18 at 15:16
















$begingroup$
Thank you for your detailed answer. +1
$endgroup$
– Fermat
Dec 22 '18 at 15:16




$begingroup$
Thank you for your detailed answer. +1
$endgroup$
– Fermat
Dec 22 '18 at 15:16


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3049292%2fthe-number-of-7%25c3%25977-matrices-with-specific-conditions%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Plaza Victoria

Puebla de Zaragoza

Musa