Let M and N be single-digit integers. If the product 2M5 x 13N is divisible by 36, how many ordered pairs (M,N) are possible? [closed]Unique Licence PlatesThe Trickster's GameLock OptimisationThree mathematicians are forever in PrisonThe Calculator with Misbehaving `+` and `*`Megan and the parcels of tilesPFG: A pretty spiral!Help me visit my friend through his new digital key lockHow many trees and birds are there?How many ordered pairs (a,b) satisfy a^2=b^3+1, where a and b are integers?

Why is the high-pass filter result in a discrete wavelet transform (DWT) downsampled?

Does Marvel have an equivalent of the Green Lantern?

expiry or manufactured date?

Why do textbooks often include the solutions to odd or even numbered problems but not both?

Archery in modern conflicts

How to remove this component from PCB

How do I professionally let my manager know I'll quit over cigarette smoke in the office?

Is my Rep in Stack-Exchange Form?

Tantum religio potuit suadere malorum – Lucretius

Does this Wild Magic result affect the sorcerer or just other creatures?

Wifi dongle speed is slower than advertised

Is it damaging to turn off a small fridge for two days every week?

What's currently blocking the construction of the wall between Mexico and the US?

Why cruise at 7000' in an A319?

Find the diameter of a word graph

Inverse-quotes-quine

How was Hillel permitted to go to the skylight to hear the shiur

Links to webpages in books

Can ADFS connect to other SSO services?

How long would it take to cross the Channel in 1890's?

Find the C-factor of a vote

Fedora boot screen shows both Fedora logo and Lenovo logo. Why and How?

Impossible darts scores

Is it possible writing coservation of relativistic energy in this naive way?



Let M and N be single-digit integers. If the product 2M5 x 13N is divisible by 36, how many ordered pairs (M,N) are possible? [closed]


Unique Licence PlatesThe Trickster's GameLock OptimisationThree mathematicians are forever in PrisonThe Calculator with Misbehaving `+` and `*`Megan and the parcels of tilesPFG: A pretty spiral!Help me visit my friend through his new digital key lockHow many trees and birds are there?How many ordered pairs (a,b) satisfy a^2=b^3+1, where a and b are integers?






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








3












$begingroup$



Let M and N be single-digit integers. If the product 2M5 x 13N is divisible by 36, how many ordered pairs (M,N) are possible?



-- source




I tried it by reducing 36 into its positive factors (1,2,3,4,6,9,18,36) and then solving, but I got way too many pairs.
Can somebody help?










share|improve this question











$endgroup$



closed as off-topic by elias, gabbo1092, Glorfindel, Rupert Morrish, athin Jun 9 at 22:38


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – elias, gabbo1092, Glorfindel, Rupert Morrish, athin
If this question can be reworded to fit the rules in the help center, please edit the question.











  • 1




    $begingroup$
    What do you mean by $2M5$ and $13N$? Are these concatenated numbers (two hundred something and five, one hundred and thirty something) or products (two times M times five, thirteen times N)?
    $endgroup$
    – Rand al'Thor
    Jun 6 at 9:32






  • 1




    $begingroup$
    Also, what is your source for these questions?
    $endgroup$
    – Rand al'Thor
    Jun 6 at 9:33






  • 1




    $begingroup$
    Or power $2M^5$?
    $endgroup$
    – Weather Vane
    Jun 6 at 9:38










  • $begingroup$
    To the close-voters: as the first answerer here, I think this is mathematically "interesting" enough not to be closed. It requires some knowledge of basic number theory (prime factorisations) if you want to do it in a quick neat way rather than brute-forcing all possibilities.
    $endgroup$
    – Rand al'Thor
    Jun 6 at 15:36











  • $begingroup$
    Sorry for answering so late. Yes, @Randal'Thor, 2M5 and 13N are concatenated numbers. And as for the source of these questions, I have a book.
    $endgroup$
    – Siddharth Garg
    Jun 6 at 16:37

















3












$begingroup$



Let M and N be single-digit integers. If the product 2M5 x 13N is divisible by 36, how many ordered pairs (M,N) are possible?



-- source




I tried it by reducing 36 into its positive factors (1,2,3,4,6,9,18,36) and then solving, but I got way too many pairs.
Can somebody help?










share|improve this question











$endgroup$



closed as off-topic by elias, gabbo1092, Glorfindel, Rupert Morrish, athin Jun 9 at 22:38


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – elias, gabbo1092, Glorfindel, Rupert Morrish, athin
If this question can be reworded to fit the rules in the help center, please edit the question.











  • 1




    $begingroup$
    What do you mean by $2M5$ and $13N$? Are these concatenated numbers (two hundred something and five, one hundred and thirty something) or products (two times M times five, thirteen times N)?
    $endgroup$
    – Rand al'Thor
    Jun 6 at 9:32






  • 1




    $begingroup$
    Also, what is your source for these questions?
    $endgroup$
    – Rand al'Thor
    Jun 6 at 9:33






  • 1




    $begingroup$
    Or power $2M^5$?
    $endgroup$
    – Weather Vane
    Jun 6 at 9:38










  • $begingroup$
    To the close-voters: as the first answerer here, I think this is mathematically "interesting" enough not to be closed. It requires some knowledge of basic number theory (prime factorisations) if you want to do it in a quick neat way rather than brute-forcing all possibilities.
    $endgroup$
    – Rand al'Thor
    Jun 6 at 15:36











  • $begingroup$
    Sorry for answering so late. Yes, @Randal'Thor, 2M5 and 13N are concatenated numbers. And as for the source of these questions, I have a book.
    $endgroup$
    – Siddharth Garg
    Jun 6 at 16:37













3












3








3


0



$begingroup$



Let M and N be single-digit integers. If the product 2M5 x 13N is divisible by 36, how many ordered pairs (M,N) are possible?



-- source




I tried it by reducing 36 into its positive factors (1,2,3,4,6,9,18,36) and then solving, but I got way too many pairs.
Can somebody help?










share|improve this question











$endgroup$





Let M and N be single-digit integers. If the product 2M5 x 13N is divisible by 36, how many ordered pairs (M,N) are possible?



-- source




I tried it by reducing 36 into its positive factors (1,2,3,4,6,9,18,36) and then solving, but I got way too many pairs.
Can somebody help?







mathematics number-theory






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Jun 9 at 19:27









Rand al'Thor

73.7k15 gold badges244 silver badges490 bronze badges




73.7k15 gold badges244 silver badges490 bronze badges










asked Jun 6 at 9:28









Siddharth GargSiddharth Garg

516 bronze badges




516 bronze badges




closed as off-topic by elias, gabbo1092, Glorfindel, Rupert Morrish, athin Jun 9 at 22:38


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – elias, gabbo1092, Glorfindel, Rupert Morrish, athin
If this question can be reworded to fit the rules in the help center, please edit the question.







closed as off-topic by elias, gabbo1092, Glorfindel, Rupert Morrish, athin Jun 9 at 22:38


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – elias, gabbo1092, Glorfindel, Rupert Morrish, athin
If this question can be reworded to fit the rules in the help center, please edit the question.







  • 1




    $begingroup$
    What do you mean by $2M5$ and $13N$? Are these concatenated numbers (two hundred something and five, one hundred and thirty something) or products (two times M times five, thirteen times N)?
    $endgroup$
    – Rand al'Thor
    Jun 6 at 9:32






  • 1




    $begingroup$
    Also, what is your source for these questions?
    $endgroup$
    – Rand al'Thor
    Jun 6 at 9:33






  • 1




    $begingroup$
    Or power $2M^5$?
    $endgroup$
    – Weather Vane
    Jun 6 at 9:38










  • $begingroup$
    To the close-voters: as the first answerer here, I think this is mathematically "interesting" enough not to be closed. It requires some knowledge of basic number theory (prime factorisations) if you want to do it in a quick neat way rather than brute-forcing all possibilities.
    $endgroup$
    – Rand al'Thor
    Jun 6 at 15:36











  • $begingroup$
    Sorry for answering so late. Yes, @Randal'Thor, 2M5 and 13N are concatenated numbers. And as for the source of these questions, I have a book.
    $endgroup$
    – Siddharth Garg
    Jun 6 at 16:37












  • 1




    $begingroup$
    What do you mean by $2M5$ and $13N$? Are these concatenated numbers (two hundred something and five, one hundred and thirty something) or products (two times M times five, thirteen times N)?
    $endgroup$
    – Rand al'Thor
    Jun 6 at 9:32






  • 1




    $begingroup$
    Also, what is your source for these questions?
    $endgroup$
    – Rand al'Thor
    Jun 6 at 9:33






  • 1




    $begingroup$
    Or power $2M^5$?
    $endgroup$
    – Weather Vane
    Jun 6 at 9:38










  • $begingroup$
    To the close-voters: as the first answerer here, I think this is mathematically "interesting" enough not to be closed. It requires some knowledge of basic number theory (prime factorisations) if you want to do it in a quick neat way rather than brute-forcing all possibilities.
    $endgroup$
    – Rand al'Thor
    Jun 6 at 15:36











  • $begingroup$
    Sorry for answering so late. Yes, @Randal'Thor, 2M5 and 13N are concatenated numbers. And as for the source of these questions, I have a book.
    $endgroup$
    – Siddharth Garg
    Jun 6 at 16:37







1




1




$begingroup$
What do you mean by $2M5$ and $13N$? Are these concatenated numbers (two hundred something and five, one hundred and thirty something) or products (two times M times five, thirteen times N)?
$endgroup$
– Rand al'Thor
Jun 6 at 9:32




$begingroup$
What do you mean by $2M5$ and $13N$? Are these concatenated numbers (two hundred something and five, one hundred and thirty something) or products (two times M times five, thirteen times N)?
$endgroup$
– Rand al'Thor
Jun 6 at 9:32




1




1




$begingroup$
Also, what is your source for these questions?
$endgroup$
– Rand al'Thor
Jun 6 at 9:33




$begingroup$
Also, what is your source for these questions?
$endgroup$
– Rand al'Thor
Jun 6 at 9:33




1




1




$begingroup$
Or power $2M^5$?
$endgroup$
– Weather Vane
Jun 6 at 9:38




$begingroup$
Or power $2M^5$?
$endgroup$
– Weather Vane
Jun 6 at 9:38












$begingroup$
To the close-voters: as the first answerer here, I think this is mathematically "interesting" enough not to be closed. It requires some knowledge of basic number theory (prime factorisations) if you want to do it in a quick neat way rather than brute-forcing all possibilities.
$endgroup$
– Rand al'Thor
Jun 6 at 15:36





$begingroup$
To the close-voters: as the first answerer here, I think this is mathematically "interesting" enough not to be closed. It requires some knowledge of basic number theory (prime factorisations) if you want to do it in a quick neat way rather than brute-forcing all possibilities.
$endgroup$
– Rand al'Thor
Jun 6 at 15:36













$begingroup$
Sorry for answering so late. Yes, @Randal'Thor, 2M5 and 13N are concatenated numbers. And as for the source of these questions, I have a book.
$endgroup$
– Siddharth Garg
Jun 6 at 16:37




$begingroup$
Sorry for answering so late. Yes, @Randal'Thor, 2M5 and 13N are concatenated numbers. And as for the source of these questions, I have a book.
$endgroup$
– Siddharth Garg
Jun 6 at 16:37










2 Answers
2






active

oldest

votes


















11












$begingroup$

I'll assume here that the number $2M5$ and $13N$ are concatenated three-digit numbers rather than products, because if they are products then the question is trivial.



Being divisible by 36 is equivalent to




being divisible by both of its prime factors $4=2^2$ and $9=3^2$.





  1. $2M5$ is odd, so both factors of 2 must come from $13N$. That means $3N$ must be a multiple of 4, so either $N=2$ or $N=6$. In either of these cases, the product is definitely a multiple of 4 - it's an "if and only if" condition.





  2. If the product is divisible by 9, then either both factors are multiples of 3 (i.e. their digit sums are multiples of 3) or one of the two factors is a multiple of 9 (i.e. its digit sum is a multiple of 9).




    Let's consider the two cases from the first numbered point above:




    • If $N=2$, then $132$ is divisible by 3 but not 9, so we need $2M5$ divisible by 3, i.e. $2+M+5$ divisible by 3, which means either $M=2$ or $M=5$ or $M=8$. In all of these cases, the product is definitely a multiple of 9.




    • If $N=6$, then $136$ is not divisible by 3, so we need $2M5$ divisible by 9, i.e. $2+M+5$ divisible by 9, which means $M=2$. Again, in this case the product is definitely a multiple of 9.




So the possibilities for the pair $(M,N)$ are:




$(2,2),(5,2),(8,2),(2,6)$ - four possibilities in all.







share|improve this answer









$endgroup$








  • 1




    $begingroup$
    @WeatherVane It's nothing to do with "you" or "me" - don't take it personally. I don't like answers which use computers instead of elegant mathematics, but i don't go around downvoting or deleting them either (unless they're on questions tagged no-computers, which this isn't). On this site, we're commenting/voting on content not people, as you should know :-)
    $endgroup$
    – Rand al'Thor
    Jun 6 at 10:55










  • $begingroup$
    Just to balance the comment you decided to leave, nobody downvoted or deleted a question, or suggested the mutual voting you accused me of requesting. You could have deleted it with the others, but for some reason decided not to.
    $endgroup$
    – Weather Vane
    Jun 6 at 17:42



















5












$begingroup$

Confirmation of the answer from Rand al'Thor using brute force with C - only 100 perms:






#include <stdio.h>

int main(void)

for(int M = 0; M < 10; M++)
for(int N = 0; N < 10; N++)
if(((205 + 10 * M) * (130 + N)) % 36 == 0)
printf("%d %dn", M, N);

2 2

2 6

5 2

8 2





share|improve this answer











$endgroup$





















    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    11












    $begingroup$

    I'll assume here that the number $2M5$ and $13N$ are concatenated three-digit numbers rather than products, because if they are products then the question is trivial.



    Being divisible by 36 is equivalent to




    being divisible by both of its prime factors $4=2^2$ and $9=3^2$.





    1. $2M5$ is odd, so both factors of 2 must come from $13N$. That means $3N$ must be a multiple of 4, so either $N=2$ or $N=6$. In either of these cases, the product is definitely a multiple of 4 - it's an "if and only if" condition.





    2. If the product is divisible by 9, then either both factors are multiples of 3 (i.e. their digit sums are multiples of 3) or one of the two factors is a multiple of 9 (i.e. its digit sum is a multiple of 9).




      Let's consider the two cases from the first numbered point above:




      • If $N=2$, then $132$ is divisible by 3 but not 9, so we need $2M5$ divisible by 3, i.e. $2+M+5$ divisible by 3, which means either $M=2$ or $M=5$ or $M=8$. In all of these cases, the product is definitely a multiple of 9.




      • If $N=6$, then $136$ is not divisible by 3, so we need $2M5$ divisible by 9, i.e. $2+M+5$ divisible by 9, which means $M=2$. Again, in this case the product is definitely a multiple of 9.




    So the possibilities for the pair $(M,N)$ are:




    $(2,2),(5,2),(8,2),(2,6)$ - four possibilities in all.







    share|improve this answer









    $endgroup$








    • 1




      $begingroup$
      @WeatherVane It's nothing to do with "you" or "me" - don't take it personally. I don't like answers which use computers instead of elegant mathematics, but i don't go around downvoting or deleting them either (unless they're on questions tagged no-computers, which this isn't). On this site, we're commenting/voting on content not people, as you should know :-)
      $endgroup$
      – Rand al'Thor
      Jun 6 at 10:55










    • $begingroup$
      Just to balance the comment you decided to leave, nobody downvoted or deleted a question, or suggested the mutual voting you accused me of requesting. You could have deleted it with the others, but for some reason decided not to.
      $endgroup$
      – Weather Vane
      Jun 6 at 17:42
















    11












    $begingroup$

    I'll assume here that the number $2M5$ and $13N$ are concatenated three-digit numbers rather than products, because if they are products then the question is trivial.



    Being divisible by 36 is equivalent to




    being divisible by both of its prime factors $4=2^2$ and $9=3^2$.





    1. $2M5$ is odd, so both factors of 2 must come from $13N$. That means $3N$ must be a multiple of 4, so either $N=2$ or $N=6$. In either of these cases, the product is definitely a multiple of 4 - it's an "if and only if" condition.





    2. If the product is divisible by 9, then either both factors are multiples of 3 (i.e. their digit sums are multiples of 3) or one of the two factors is a multiple of 9 (i.e. its digit sum is a multiple of 9).




      Let's consider the two cases from the first numbered point above:




      • If $N=2$, then $132$ is divisible by 3 but not 9, so we need $2M5$ divisible by 3, i.e. $2+M+5$ divisible by 3, which means either $M=2$ or $M=5$ or $M=8$. In all of these cases, the product is definitely a multiple of 9.




      • If $N=6$, then $136$ is not divisible by 3, so we need $2M5$ divisible by 9, i.e. $2+M+5$ divisible by 9, which means $M=2$. Again, in this case the product is definitely a multiple of 9.




    So the possibilities for the pair $(M,N)$ are:




    $(2,2),(5,2),(8,2),(2,6)$ - four possibilities in all.







    share|improve this answer









    $endgroup$








    • 1




      $begingroup$
      @WeatherVane It's nothing to do with "you" or "me" - don't take it personally. I don't like answers which use computers instead of elegant mathematics, but i don't go around downvoting or deleting them either (unless they're on questions tagged no-computers, which this isn't). On this site, we're commenting/voting on content not people, as you should know :-)
      $endgroup$
      – Rand al'Thor
      Jun 6 at 10:55










    • $begingroup$
      Just to balance the comment you decided to leave, nobody downvoted or deleted a question, or suggested the mutual voting you accused me of requesting. You could have deleted it with the others, but for some reason decided not to.
      $endgroup$
      – Weather Vane
      Jun 6 at 17:42














    11












    11








    11





    $begingroup$

    I'll assume here that the number $2M5$ and $13N$ are concatenated three-digit numbers rather than products, because if they are products then the question is trivial.



    Being divisible by 36 is equivalent to




    being divisible by both of its prime factors $4=2^2$ and $9=3^2$.





    1. $2M5$ is odd, so both factors of 2 must come from $13N$. That means $3N$ must be a multiple of 4, so either $N=2$ or $N=6$. In either of these cases, the product is definitely a multiple of 4 - it's an "if and only if" condition.





    2. If the product is divisible by 9, then either both factors are multiples of 3 (i.e. their digit sums are multiples of 3) or one of the two factors is a multiple of 9 (i.e. its digit sum is a multiple of 9).




      Let's consider the two cases from the first numbered point above:




      • If $N=2$, then $132$ is divisible by 3 but not 9, so we need $2M5$ divisible by 3, i.e. $2+M+5$ divisible by 3, which means either $M=2$ or $M=5$ or $M=8$. In all of these cases, the product is definitely a multiple of 9.




      • If $N=6$, then $136$ is not divisible by 3, so we need $2M5$ divisible by 9, i.e. $2+M+5$ divisible by 9, which means $M=2$. Again, in this case the product is definitely a multiple of 9.




    So the possibilities for the pair $(M,N)$ are:




    $(2,2),(5,2),(8,2),(2,6)$ - four possibilities in all.







    share|improve this answer









    $endgroup$



    I'll assume here that the number $2M5$ and $13N$ are concatenated three-digit numbers rather than products, because if they are products then the question is trivial.



    Being divisible by 36 is equivalent to




    being divisible by both of its prime factors $4=2^2$ and $9=3^2$.





    1. $2M5$ is odd, so both factors of 2 must come from $13N$. That means $3N$ must be a multiple of 4, so either $N=2$ or $N=6$. In either of these cases, the product is definitely a multiple of 4 - it's an "if and only if" condition.





    2. If the product is divisible by 9, then either both factors are multiples of 3 (i.e. their digit sums are multiples of 3) or one of the two factors is a multiple of 9 (i.e. its digit sum is a multiple of 9).




      Let's consider the two cases from the first numbered point above:




      • If $N=2$, then $132$ is divisible by 3 but not 9, so we need $2M5$ divisible by 3, i.e. $2+M+5$ divisible by 3, which means either $M=2$ or $M=5$ or $M=8$. In all of these cases, the product is definitely a multiple of 9.




      • If $N=6$, then $136$ is not divisible by 3, so we need $2M5$ divisible by 9, i.e. $2+M+5$ divisible by 9, which means $M=2$. Again, in this case the product is definitely a multiple of 9.




    So the possibilities for the pair $(M,N)$ are:




    $(2,2),(5,2),(8,2),(2,6)$ - four possibilities in all.








    share|improve this answer












    share|improve this answer



    share|improve this answer










    answered Jun 6 at 9:41









    Rand al'ThorRand al'Thor

    73.7k15 gold badges244 silver badges490 bronze badges




    73.7k15 gold badges244 silver badges490 bronze badges







    • 1




      $begingroup$
      @WeatherVane It's nothing to do with "you" or "me" - don't take it personally. I don't like answers which use computers instead of elegant mathematics, but i don't go around downvoting or deleting them either (unless they're on questions tagged no-computers, which this isn't). On this site, we're commenting/voting on content not people, as you should know :-)
      $endgroup$
      – Rand al'Thor
      Jun 6 at 10:55










    • $begingroup$
      Just to balance the comment you decided to leave, nobody downvoted or deleted a question, or suggested the mutual voting you accused me of requesting. You could have deleted it with the others, but for some reason decided not to.
      $endgroup$
      – Weather Vane
      Jun 6 at 17:42













    • 1




      $begingroup$
      @WeatherVane It's nothing to do with "you" or "me" - don't take it personally. I don't like answers which use computers instead of elegant mathematics, but i don't go around downvoting or deleting them either (unless they're on questions tagged no-computers, which this isn't). On this site, we're commenting/voting on content not people, as you should know :-)
      $endgroup$
      – Rand al'Thor
      Jun 6 at 10:55










    • $begingroup$
      Just to balance the comment you decided to leave, nobody downvoted or deleted a question, or suggested the mutual voting you accused me of requesting. You could have deleted it with the others, but for some reason decided not to.
      $endgroup$
      – Weather Vane
      Jun 6 at 17:42








    1




    1




    $begingroup$
    @WeatherVane It's nothing to do with "you" or "me" - don't take it personally. I don't like answers which use computers instead of elegant mathematics, but i don't go around downvoting or deleting them either (unless they're on questions tagged no-computers, which this isn't). On this site, we're commenting/voting on content not people, as you should know :-)
    $endgroup$
    – Rand al'Thor
    Jun 6 at 10:55




    $begingroup$
    @WeatherVane It's nothing to do with "you" or "me" - don't take it personally. I don't like answers which use computers instead of elegant mathematics, but i don't go around downvoting or deleting them either (unless they're on questions tagged no-computers, which this isn't). On this site, we're commenting/voting on content not people, as you should know :-)
    $endgroup$
    – Rand al'Thor
    Jun 6 at 10:55












    $begingroup$
    Just to balance the comment you decided to leave, nobody downvoted or deleted a question, or suggested the mutual voting you accused me of requesting. You could have deleted it with the others, but for some reason decided not to.
    $endgroup$
    – Weather Vane
    Jun 6 at 17:42





    $begingroup$
    Just to balance the comment you decided to leave, nobody downvoted or deleted a question, or suggested the mutual voting you accused me of requesting. You could have deleted it with the others, but for some reason decided not to.
    $endgroup$
    – Weather Vane
    Jun 6 at 17:42














    5












    $begingroup$

    Confirmation of the answer from Rand al'Thor using brute force with C - only 100 perms:






    #include <stdio.h>

    int main(void)

    for(int M = 0; M < 10; M++)
    for(int N = 0; N < 10; N++)
    if(((205 + 10 * M) * (130 + N)) % 36 == 0)
    printf("%d %dn", M, N);

    2 2

    2 6

    5 2

    8 2





    share|improve this answer











    $endgroup$

















      5












      $begingroup$

      Confirmation of the answer from Rand al'Thor using brute force with C - only 100 perms:






      #include <stdio.h>

      int main(void)

      for(int M = 0; M < 10; M++)
      for(int N = 0; N < 10; N++)
      if(((205 + 10 * M) * (130 + N)) % 36 == 0)
      printf("%d %dn", M, N);

      2 2

      2 6

      5 2

      8 2





      share|improve this answer











      $endgroup$















        5












        5








        5





        $begingroup$

        Confirmation of the answer from Rand al'Thor using brute force with C - only 100 perms:






        #include <stdio.h>

        int main(void)

        for(int M = 0; M < 10; M++)
        for(int N = 0; N < 10; N++)
        if(((205 + 10 * M) * (130 + N)) % 36 == 0)
        printf("%d %dn", M, N);

        2 2

        2 6

        5 2

        8 2





        share|improve this answer











        $endgroup$



        Confirmation of the answer from Rand al'Thor using brute force with C - only 100 perms:






        #include <stdio.h>

        int main(void)

        for(int M = 0; M < 10; M++)
        for(int N = 0; N < 10; N++)
        if(((205 + 10 * M) * (130 + N)) % 36 == 0)
        printf("%d %dn", M, N);

        2 2

        2 6

        5 2

        8 2






        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited Jun 6 at 10:02

























        answered Jun 6 at 9:57









        Weather VaneWeather Vane

        4,1321 gold badge1 silver badge19 bronze badges




        4,1321 gold badge1 silver badge19 bronze badges













            Popular posts from this blog

            Club Baloncesto Breogán Índice Historia | Pavillón | Nome | O Breogán na cultura popular | Xogadores | Adestradores | Presidentes | Palmarés | Historial | Líderes | Notas | Véxase tamén | Menú de navegacióncbbreogan.galCadroGuía oficial da ACB 2009-10, páxina 201Guía oficial ACB 1992, páxina 183. Editorial DB.É de 6.500 espectadores sentados axeitándose á última normativa"Estudiantes Junior, entre as mellores canteiras"o orixinalHemeroteca El Mundo Deportivo, 16 setembro de 1970, páxina 12Historia do BreogánAlfredo Pérez, o último canoneiroHistoria C.B. BreogánHemeroteca de El Mundo DeportivoJimmy Wright, norteamericano do Breogán deixará Lugo por ameazas de morteResultados de Breogán en 1986-87Resultados de Breogán en 1990-91Ficha de Velimir Perasović en acb.comResultados de Breogán en 1994-95Breogán arrasa al Barça. "El Mundo Deportivo", 27 de setembro de 1999, páxina 58CB Breogán - FC BarcelonaA FEB invita a participar nunha nova Liga EuropeaCharlie Bell na prensa estatalMáximos anotadores 2005Tempada 2005-06 : Tódolos Xogadores da Xornada""Non quero pensar nunha man negra, mais pregúntome que está a pasar""o orixinalRaúl López, orgulloso dos xogadores, presume da boa saúde económica do BreogánJulio González confirma que cesa como presidente del BreogánHomenaxe a Lisardo GómezA tempada do rexurdimento celesteEntrevista a Lisardo GómezEl COB dinamita el Pazo para forzar el quinto (69-73)Cafés Candelas, patrocinador del CB Breogán"Suso Lázare, novo presidente do Breogán"o orixinalCafés Candelas Breogán firma el mayor triunfo de la historiaEl Breogán realizará 17 homenajes por su cincuenta aniversario"O Breogán honra ao seu fundador e primeiro presidente"o orixinalMiguel Giao recibiu a homenaxe do PazoHomenaxe aos primeiros gladiadores celestesO home que nos amosa como ver o Breo co corazónTita Franco será homenaxeada polos #50anosdeBreoJulio Vila recibirá unha homenaxe in memoriam polos #50anosdeBreo"O Breogán homenaxeará aos seus aboados máis veteráns"Pechada ovación a «Capi» Sanmartín e Ricardo «Corazón de González»Homenaxe por décadas de informaciónPaco García volve ao Pazo con motivo do 50 aniversario"Resultados y clasificaciones""O Cafés Candelas Breogán, campión da Copa Princesa""O Cafés Candelas Breogán, equipo ACB"C.B. Breogán"Proxecto social"o orixinal"Centros asociados"o orixinalFicha en imdb.comMario Camus trata la recuperación del amor en 'La vieja música', su última película"Páxina web oficial""Club Baloncesto Breogán""C. B. Breogán S.A.D."eehttp://www.fegaba.com

            Vilaño, A Laracha Índice Patrimonio | Lugares e parroquias | Véxase tamén | Menú de navegación43°14′52″N 8°36′03″O / 43.24775, -8.60070

            Cegueira Índice Epidemioloxía | Deficiencia visual | Tipos de cegueira | Principais causas de cegueira | Tratamento | Técnicas de adaptación e axudas | Vida dos cegos | Primeiros auxilios | Crenzas respecto das persoas cegas | Crenzas das persoas cegas | O neno deficiente visual | Aspectos psicolóxicos da cegueira | Notas | Véxase tamén | Menú de navegación54.054.154.436928256blindnessDicionario da Real Academia GalegaPortal das Palabras"International Standards: Visual Standards — Aspects and Ranges of Vision Loss with Emphasis on Population Surveys.""Visual impairment and blindness""Presentan un plan para previr a cegueira"o orixinalACCDV Associació Catalana de Cecs i Disminuïts Visuals - PMFTrachoma"Effect of gene therapy on visual function in Leber's congenital amaurosis"1844137110.1056/NEJMoa0802268Cans guía - os mellores amigos dos cegosArquivadoEscola de cans guía para cegos en Mortágua, PortugalArquivado"Tecnología para ciegos y deficientes visuales. Recopilación de recursos gratuitos en la Red""Colorino""‘COL.diesis’, escuchar los sonidos del color""COL.diesis: Transforming Colour into Melody and Implementing the Result in a Colour Sensor Device"o orixinal"Sistema de desarrollo de sinestesia color-sonido para invidentes utilizando un protocolo de audio""Enseñanza táctil - geometría y color. Juegos didácticos para niños ciegos y videntes""Sistema Constanz"L'ocupació laboral dels cecs a l'Estat espanyol està pràcticament equiparada a la de les persones amb visió, entrevista amb Pedro ZuritaONCE (Organización Nacional de Cegos de España)Prevención da cegueiraDescrición de deficiencias visuais (Disc@pnet)Braillín, un boneco atractivo para calquera neno, con ou sen discapacidade, que permite familiarizarse co sistema de escritura e lectura brailleAxudas Técnicas36838ID00897494007150-90057129528256DOID:1432HP:0000618D001766C10.597.751.941.162C97109C0155020