$N$'s base-5 and base-6 representations, treated as base-10, yield sum $S$. For which $N$ are $S$'s rightmost two digits the same as $2N$'s? The 2019 Stack Overflow Developer Survey Results Are In Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Max product of $20$ numbers with mean $12$ if $n$-th number is $fracn2$ or $2n$?Logic problem on sum of possible numbers a given person can have if they had a conversation with another.Three numbers a, b, c, over 1 have a sum of $frac67$. What is a+b+c?Evaluating $frac2013^3-2cdot 2013^2cdot 2014+3cdot 2013cdot 2014^2-2014^3+12013cdot 2014$Sum of 5 square roots equals another square root. What is the minimum possible value of the summed square root?For distinct positive reals $A$ and $B$, neither equal to $1$, such that $log_A B = log_B A$, find $AB$.Given a strip of 7 small triangles each with an area of 1, what is the area of the created trapezoid below the strip?How many distinct values does $f(x)$ assume for $x ge 0$?What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$?How many solutions does $x^2 equiv -1 pmod 365$ have?Public Key Scheme decryption.If $b equiv 0 pmod a$ and $c equiv 0 pmod b$, then $c equiv 0 pmod a$Intermediate Modular Arithmetic Strategy And QuestionsProof Using Modular Arithmetic - Divisibility using co-prime numbersFinding last digitsSubstitutions in Modular ArithmeticHow many integers of $ m $ digits are equal to the sum of the $ m $ -th powers of their digits in base $7$ in the interval $[1, …, 10 ^ 7]$?If $p equiv 1 pmod 4$ where $p$ is an odd prime, then $x^2 equiv -1 pmod p^k$ where $k$ is any integer has $2$ solutions.What is the largest three-digit integer that when cubed, the result ends in itself
How do spell lists change if the party levels up without taking a long rest?
Can I visit the Trinity College (Cambridge) library and see some of their rare books
Huge performance difference of the command find with and without using %M option to show permissions
One-dimensional Japanese puzzle
Why don't hard Brexiteers insist on a hard border to prevent illegal immigration after Brexit?
Is it ethical to upload a automatically generated paper to a non peer-reviewed site as part of a larger research?
Are spiders unable to hurt humans, especially very small spiders?
What was the last x86 CPU that did not have the x87 floating-point unit built in?
how can a perfect fourth interval be considered either consonant or dissonant?
First use of “packing” as in carrying a gun
Sort list of array linked objects by keys and values
Is there a writing software that you can sort scenes like slides in PowerPoint?
Can withdrawing asylum be illegal?
Are there continuous functions who are the same in an interval but differ in at least one other point?
For what reasons would an animal species NOT cross a *horizontal* land bridge?
How do I design a circuit to convert a 100 mV and 50 Hz sine wave to a square wave?
Sub-subscripts in strings cause different spacings than subscripts
Match Roman Numerals
Do working physicists consider Newtonian mechanics to be "falsified"?
should truth entail possible truth
Is it ok to offer lower paid work as a trial period before negotiating for a full-time job?
Why did Peik Lin say, "I'm not an animal"?
Deal with toxic manager when you can't quit
How did the audience guess the pentatonic scale in Bobby McFerrin's presentation?
$N$'s base-5 and base-6 representations, treated as base-10, yield sum $S$. For which $N$ are $S$'s rightmost two digits the same as $2N$'s?
The 2019 Stack Overflow Developer Survey Results Are In
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Max product of $20$ numbers with mean $12$ if $n$-th number is $fracn2$ or $2n$?Logic problem on sum of possible numbers a given person can have if they had a conversation with another.Three numbers a, b, c, over 1 have a sum of $frac67$. What is a+b+c?Evaluating $frac2013^3-2cdot 2013^2cdot 2014+3cdot 2013cdot 2014^2-2014^3+12013cdot 2014$Sum of 5 square roots equals another square root. What is the minimum possible value of the summed square root?For distinct positive reals $A$ and $B$, neither equal to $1$, such that $log_A B = log_B A$, find $AB$.Given a strip of 7 small triangles each with an area of 1, what is the area of the created trapezoid below the strip?How many distinct values does $f(x)$ assume for $x ge 0$?What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$?How many solutions does $x^2 equiv -1 pmod 365$ have?Public Key Scheme decryption.If $b equiv 0 pmod a$ and $c equiv 0 pmod b$, then $c equiv 0 pmod a$Intermediate Modular Arithmetic Strategy And QuestionsProof Using Modular Arithmetic - Divisibility using co-prime numbersFinding last digitsSubstitutions in Modular ArithmeticHow many integers of $ m $ digits are equal to the sum of the $ m $ -th powers of their digits in base $7$ in the interval $[1, …, 10 ^ 7]$?If $p equiv 1 pmod 4$ where $p$ is an odd prime, then $x^2 equiv -1 pmod p^k$ where $k$ is any integer has $2$ solutions.What is the largest three-digit integer that when cubed, the result ends in itself
$begingroup$
Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$. For example, if $N = 749$, Bernardo writes the numbers $10,!444$ and $3,!245$, and LeRoy obtains the sum $S = 13,!689$. For how many choices of $N$ are the two rightmost digits of $S$, in order, the same as those of $2N$?
What I have tried:
First, I can examine the units digits of the number base 5 and base 6 and eliminate some possibilities.
Say that $N equiv a pmod6$
also that $N equiv b pmod5$
Substituting these equations into the question and setting the units digits of $2N$ and $S$ equal to each other, it can be seen that $a=b$, and $b < 5$, so
$N equiv a pmod6$,
$N equiv a pmod5$,
$implies N=a pmod30$,
$0 le a le 4 $
Therefore, $N$ can be written as $30x+y$
and $2N$ can be written as $60x+2y$
I see that $y$ can be one of five choices: $0, 1, 2, 3,$ or $4$, ;
Also, we have already found which digits of $y$ will add up into the units digits of $2N$.
I'm stuck here and how should I continue?
Help is appreciated!
Thanks!
Max0815
modular-arithmetic
asked Feb 3 at 4:25
Max0815Max0815
81418
$endgroup$
add a comment |
$begingroup$
Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$. For example, if $N = 749$, Bernardo writes the numbers $10,!444$ and $3,!245$, and LeRoy obtains the sum $S = 13,!689$. For how many choices of $N$ are the two rightmost digits of $S$, in order, the same as those of $2N$?
What I have tried:
First, I can examine the units digits of the number base 5 and base 6 and eliminate some possibilities.
Say that $N equiv a pmod6$
also that $N equiv b pmod5$
Substituting these equations into the question and setting the units digits of $2N$ and $S$ equal to each other, it can be seen that $a=b$, and $b < 5$, so
$N equiv a pmod6$,
$N equiv a pmod5$,
$implies N=a pmod30$,
$0 le a le 4 $
Therefore, $N$ can be written as $30x+y$
and $2N$ can be written as $60x+2y$
I see that $y$ can be one of five choices: $0, 1, 2, 3,$ or $4$, ;
Also, we have already found which digits of $y$ will add up into the units digits of $2N$.
I'm stuck here and how should I continue?
Help is appreciated!
Thanks!
Max0815
modular-arithmetic
asked Feb 3 at 4:25
Max0815Max0815
81418
$endgroup$
add a comment |
$begingroup$
Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$. For example, if $N = 749$, Bernardo writes the numbers $10,!444$ and $3,!245$, and LeRoy obtains the sum $S = 13,!689$. For how many choices of $N$ are the two rightmost digits of $S$, in order, the same as those of $2N$?
What I have tried:
First, I can examine the units digits of the number base 5 and base 6 and eliminate some possibilities.
Say that $N equiv a pmod6$
also that $N equiv b pmod5$
Substituting these equations into the question and setting the units digits of $2N$ and $S$ equal to each other, it can be seen that $a=b$, and $b < 5$, so
$N equiv a pmod6$,
$N equiv a pmod5$,
$implies N=a pmod30$,
$0 le a le 4 $
Therefore, $N$ can be written as $30x+y$
and $2N$ can be written as $60x+2y$
I see that $y$ can be one of five choices: $0, 1, 2, 3,$ or $4$, ;
Also, we have already found which digits of $y$ will add up into the units digits of $2N$.
I'm stuck here and how should I continue?
Help is appreciated!
Thanks!
Max0815
modular-arithmetic
asked Feb 3 at 4:25
Max0815Max0815
81418
$endgroup$
Bernardo chooses a three-digit positive integer $N$ and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer $S$. For example, if $N = 749$, Bernardo writes the numbers $10,!444$ and $3,!245$, and LeRoy obtains the sum $S = 13,!689$. For how many choices of $N$ are the two rightmost digits of $S$, in order, the same as those of $2N$?
What I have tried:
First, I can examine the units digits of the number base 5 and base 6 and eliminate some possibilities.
Say that $N equiv a pmod6$
also that $N equiv b pmod5$
Substituting these equations into the question and setting the units digits of $2N$ and $S$ equal to each other, it can be seen that $a=b$, and $b < 5$, so
$N equiv a pmod6$,
$N equiv a pmod5$,
$implies N=a pmod30$,
$0 le a le 4 $
Therefore, $N$ can be written as $30x+y$
and $2N$ can be written as $60x+2y$
I see that $y$ can be one of five choices: $0, 1, 2, 3,$ or $4$, ;
Also, we have already found which digits of $y$ will add up into the units digits of $2N$.
I'm stuck here and how should I continue?
Help is appreciated!
Thanks!
Max0815
modular-arithmetic
modular-arithmetic
asked Feb 3 at 4:25
Max0815Max0815
81418
asked Feb 3 at 4:25
Max0815Max0815
81418
edited Mar 24 at 19:23
Max0815
asked Feb 3 at 4:25
Max0815Max0815
81418
asked Feb 3 at 4:25
Max0815Max0815
81418
asked Feb 3 at 4:25
Max0815Max0815
81418
81418
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let $I_5$ be the last two digits of $N$ in base 5 but treating it as a base 10 integer.
Let $I_6$ be the last two digits of $N$ in base 6 but treating it as a base 10 integer.
The largest number $I_5$ can be is 44. The largest number $I_6$ can be is 55. So this means that the sum of the two can be no bigger than 99. This implies that there is no overflow problem into the third digit when adding the two numbers. In fact no digit pair will ever carry into the next digit.The reason for this is the digit range of the base 5 number is 0-4 and the digit range of the base 6 number is 0-5. The sum of which is 0-9.
$I_5$ cycles every 25 numbers. $I_6$ cycles every 36 numbers. The last two digits of $N$ cycles every 100 numbers. The lcm of 25,36,and 100 is 900. This means that the numbers that will produce equality for the two right most digits of $2N$ and $S$ will be in a cycle of 900. The op has already shown that the numbers must be of the form $30x+y$ where $x,yinBbbNspace|space 0le yle 4$. Since digit matchings are independent. If a $30x$ number matches the tens digit for $2N$ and $S$ then all numbers $30x+y$ numbers (for the same $x$) will match both digits. Putting all of this together; only the tens digit of multiples of 30 of $N$ less than 900 have to be examined. The equation that we want to solve is this: $$I_5+I_6=2Npmod100$$ $$equivalently$$
$$I_5+I_6=60xpmod100$$
If we focus on the tens digit we can change the problem to this:
$$xpmod5+(6-x)pmod6equiv6xpmod10quadquadquad(1)$$
Then move the left most term to the right side:
$$(6-x)pmod6equiv6xpmod10-xpmod5quadquadquad(2)$$
What is good about equation (2) is that the result of the right side has the following 5 number sequence $0,5,0,5,0$. The left side of equation (2) is 0 when $x pmod6equiv0$. The right side of equation (2) is 5 when $x pmod6equiv1$. So now all we have to do is solve 5 Chinese remainder theorem problems
$$beginmatrix
6a & 5b\
6a & 5b+2\
6a & 5b+4\
6a+1 & 5b+1\
6a+1 & 5b+3\
endmatrix$$
The result is $x=30p+q$ where $qin0,1,12,13,24$. In order to get the values for $N$, x has multiplied by 30 then added to y. So $$N=900p+30q+y$$ or the last two digits of $2N$ and $S$ are the same iff
$$Npmod900equiv0,1,2,3,4,30,31,32,33,34,360,361,362,363,364,390,391,392,393,394,720,721,722,723,724$$
Edit: when I first saw this problem I misinterpreted it and thought that there were two $S$'s one for N and one for $2N$ and the goal was to get the last two digits of the $S$'s the same. I managed to solve that problem as well. The solution to that problem is below in case anyone is interested.
Let $F_5$ be the last two digits of $2N$ in base 5 but treating it as a base 10 integer.
Let $F_6$ be the last two digits of $2N$ in base 6 but treating it as a base 10 integer.
Our goal then is to find when $$I_5+I_6=F_5+F_6quad (3)$$
With some simple algebra (3) can be rewritten as
$$F_5-I_5=I_6-F_6 (4)$$
The chart directly below shows all possible values of $F_5$ and $I_5$ and the difference between them. (In order of $I_5$ values)
$$
beginarrayr
F_5 & I_5 & F_5-I_5\
hline
00 & 00 & 0\
02 & 01 & 1\
04 & 02 & 2\
11 & 03 & 8\
13 & 04 & 9\
20 & 10 & 10\
22 & 11 & 11\
24 & 12 & 12\
31 & 13 & 18\
33 & 14 & 19\
40 & 20 & 20\
42 & 21 & 21\
44 & 22 & 22\
01 & 23 & -22\
03 & 24 & -21\
10 & 30 & -20\
12 & 31 & -19\
14 & 32 & -18\
21 & 33 & -12\
23 & 34 & -11\
30 & 40 & -10\
32 & 41 & -9\
34 & 42 & -8\
41 & 43 & -2\
43 & 44 & -1\
endarray
$$
The chart directly below shows all possible values of $I_6$ and $F_6$ and the difference between them. (In order of $I_6$ values)
$$
beginarrayr
I_6 & F_6 & I_6-F_6\
hline
00 & 00 & 0\
01 & 02 & -1\
02 & 04 & -2\
03 & 10 & -7\
04 & 12 & -8\
05 & 14 & -9\
10 & 20 & -10\
11 & 22 & -11\
12 & 24 & -12\
13 & 30 & -17\
14 & 32 & -18\
15 & 34 & -19\
20 & 40 & -20\
21 & 42 & -21\
22 & 44 & -22\
23 & 50 & -27\
24 & 52 & -28\
25 & 54 & -29\
30 & 00 & 30\
31 & 02 & 29\
32 & 04 & 28\
33 & 10 & 23\
34 & 12 & 22\
35 & 14 & 21\
40 & 20 & 20\
41 & 22 & 19\
42 & 24 & 18\
43 & 30 & 13\
44 & 32 & 12\
45 & 34 & 11\
50 & 40 & 10\
51 & 42 & 9\
52 & 44 & 8\
53 & 50 & 3\
54 & 52 & 2\
55 & 54 & 1\
endarray
$$
Now we just have to match the difference values of the two charts using modular arithmetic. In the first chart the values cycle every 25 numbers so the rows of the first chart corresponds with $Npmod25$. In the second chart the values cycle every 36 numbers so the rows of the second chart corresponds with $Npmod36$.
If the following rules are applied in order they can be used to determine if the last two digits of $S$ obtained from $2N$ will match the last two digits of $S$ obtained from $N$.
Rule 1: If $N equiv 3pmod6$ then the digits will not match
Rule 2: If $Npmod25+Npmod36=0$ then the digits will match
Rule 3: If $$1le Npmod36le 14$$ and $$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=25$$ the digits will match
Rule 4: If
$$22le Npmod36$$
and
$$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=30$$
the digits will match
Rule 5: in any other case the digits will not match
answered Mar 24 at 23:03
quantus14quantus14
1,41211010
$endgroup$
$begingroup$
Thank you very much! Your help is appreciated!
$endgroup$
– Max0815
Mar 25 at 15:26
add a comment |
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3098173%2fns-base-5-and-base-6-representations-treated-as-base-10-yield-sum-s-for%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
$begingroup$
Let $I_5$ be the last two digits of $N$ in base 5 but treating it as a base 10 integer.
Let $I_6$ be the last two digits of $N$ in base 6 but treating it as a base 10 integer.
The largest number $I_5$ can be is 44. The largest number $I_6$ can be is 55. So this means that the sum of the two can be no bigger than 99. This implies that there is no overflow problem into the third digit when adding the two numbers. In fact no digit pair will ever carry into the next digit.The reason for this is the digit range of the base 5 number is 0-4 and the digit range of the base 6 number is 0-5. The sum of which is 0-9.
$I_5$ cycles every 25 numbers. $I_6$ cycles every 36 numbers. The last two digits of $N$ cycles every 100 numbers. The lcm of 25,36,and 100 is 900. This means that the numbers that will produce equality for the two right most digits of $2N$ and $S$ will be in a cycle of 900. The op has already shown that the numbers must be of the form $30x+y$ where $x,yinBbbNspace|space 0le yle 4$. Since digit matchings are independent. If a $30x$ number matches the tens digit for $2N$ and $S$ then all numbers $30x+y$ numbers (for the same $x$) will match both digits. Putting all of this together; only the tens digit of multiples of 30 of $N$ less than 900 have to be examined. The equation that we want to solve is this: $$I_5+I_6=2Npmod100$$ $$equivalently$$
$$I_5+I_6=60xpmod100$$
If we focus on the tens digit we can change the problem to this:
$$xpmod5+(6-x)pmod6equiv6xpmod10quadquadquad(1)$$
Then move the left most term to the right side:
$$(6-x)pmod6equiv6xpmod10-xpmod5quadquadquad(2)$$
What is good about equation (2) is that the result of the right side has the following 5 number sequence $0,5,0,5,0$. The left side of equation (2) is 0 when $x pmod6equiv0$. The right side of equation (2) is 5 when $x pmod6equiv1$. So now all we have to do is solve 5 Chinese remainder theorem problems
$$beginmatrix
6a & 5b\
6a & 5b+2\
6a & 5b+4\
6a+1 & 5b+1\
6a+1 & 5b+3\
endmatrix$$
The result is $x=30p+q$ where $qin0,1,12,13,24$. In order to get the values for $N$, x has multiplied by 30 then added to y. So $$N=900p+30q+y$$ or the last two digits of $2N$ and $S$ are the same iff
$$Npmod900equiv0,1,2,3,4,30,31,32,33,34,360,361,362,363,364,390,391,392,393,394,720,721,722,723,724$$
Edit: when I first saw this problem I misinterpreted it and thought that there were two $S$'s one for N and one for $2N$ and the goal was to get the last two digits of the $S$'s the same. I managed to solve that problem as well. The solution to that problem is below in case anyone is interested.
Let $F_5$ be the last two digits of $2N$ in base 5 but treating it as a base 10 integer.
Let $F_6$ be the last two digits of $2N$ in base 6 but treating it as a base 10 integer.
Our goal then is to find when $$I_5+I_6=F_5+F_6quad (3)$$
With some simple algebra (3) can be rewritten as
$$F_5-I_5=I_6-F_6 (4)$$
The chart directly below shows all possible values of $F_5$ and $I_5$ and the difference between them. (In order of $I_5$ values)
$$
beginarrayr
F_5 & I_5 & F_5-I_5\
hline
00 & 00 & 0\
02 & 01 & 1\
04 & 02 & 2\
11 & 03 & 8\
13 & 04 & 9\
20 & 10 & 10\
22 & 11 & 11\
24 & 12 & 12\
31 & 13 & 18\
33 & 14 & 19\
40 & 20 & 20\
42 & 21 & 21\
44 & 22 & 22\
01 & 23 & -22\
03 & 24 & -21\
10 & 30 & -20\
12 & 31 & -19\
14 & 32 & -18\
21 & 33 & -12\
23 & 34 & -11\
30 & 40 & -10\
32 & 41 & -9\
34 & 42 & -8\
41 & 43 & -2\
43 & 44 & -1\
endarray
$$
The chart directly below shows all possible values of $I_6$ and $F_6$ and the difference between them. (In order of $I_6$ values)
$$
beginarrayr
I_6 & F_6 & I_6-F_6\
hline
00 & 00 & 0\
01 & 02 & -1\
02 & 04 & -2\
03 & 10 & -7\
04 & 12 & -8\
05 & 14 & -9\
10 & 20 & -10\
11 & 22 & -11\
12 & 24 & -12\
13 & 30 & -17\
14 & 32 & -18\
15 & 34 & -19\
20 & 40 & -20\
21 & 42 & -21\
22 & 44 & -22\
23 & 50 & -27\
24 & 52 & -28\
25 & 54 & -29\
30 & 00 & 30\
31 & 02 & 29\
32 & 04 & 28\
33 & 10 & 23\
34 & 12 & 22\
35 & 14 & 21\
40 & 20 & 20\
41 & 22 & 19\
42 & 24 & 18\
43 & 30 & 13\
44 & 32 & 12\
45 & 34 & 11\
50 & 40 & 10\
51 & 42 & 9\
52 & 44 & 8\
53 & 50 & 3\
54 & 52 & 2\
55 & 54 & 1\
endarray
$$
Now we just have to match the difference values of the two charts using modular arithmetic. In the first chart the values cycle every 25 numbers so the rows of the first chart corresponds with $Npmod25$. In the second chart the values cycle every 36 numbers so the rows of the second chart corresponds with $Npmod36$.
If the following rules are applied in order they can be used to determine if the last two digits of $S$ obtained from $2N$ will match the last two digits of $S$ obtained from $N$.
Rule 1: If $N equiv 3pmod6$ then the digits will not match
Rule 2: If $Npmod25+Npmod36=0$ then the digits will match
Rule 3: If $$1le Npmod36le 14$$ and $$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=25$$ the digits will match
Rule 4: If
$$22le Npmod36$$
and
$$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=30$$
the digits will match
Rule 5: in any other case the digits will not match
answered Mar 24 at 23:03
quantus14quantus14
1,41211010
$endgroup$
$begingroup$
Thank you very much! Your help is appreciated!
$endgroup$
– Max0815
Mar 25 at 15:26
add a comment |
$begingroup$
Let $I_5$ be the last two digits of $N$ in base 5 but treating it as a base 10 integer.
Let $I_6$ be the last two digits of $N$ in base 6 but treating it as a base 10 integer.
The largest number $I_5$ can be is 44. The largest number $I_6$ can be is 55. So this means that the sum of the two can be no bigger than 99. This implies that there is no overflow problem into the third digit when adding the two numbers. In fact no digit pair will ever carry into the next digit.The reason for this is the digit range of the base 5 number is 0-4 and the digit range of the base 6 number is 0-5. The sum of which is 0-9.
$I_5$ cycles every 25 numbers. $I_6$ cycles every 36 numbers. The last two digits of $N$ cycles every 100 numbers. The lcm of 25,36,and 100 is 900. This means that the numbers that will produce equality for the two right most digits of $2N$ and $S$ will be in a cycle of 900. The op has already shown that the numbers must be of the form $30x+y$ where $x,yinBbbNspace|space 0le yle 4$. Since digit matchings are independent. If a $30x$ number matches the tens digit for $2N$ and $S$ then all numbers $30x+y$ numbers (for the same $x$) will match both digits. Putting all of this together; only the tens digit of multiples of 30 of $N$ less than 900 have to be examined. The equation that we want to solve is this: $$I_5+I_6=2Npmod100$$ $$equivalently$$
$$I_5+I_6=60xpmod100$$
If we focus on the tens digit we can change the problem to this:
$$xpmod5+(6-x)pmod6equiv6xpmod10quadquadquad(1)$$
Then move the left most term to the right side:
$$(6-x)pmod6equiv6xpmod10-xpmod5quadquadquad(2)$$
What is good about equation (2) is that the result of the right side has the following 5 number sequence $0,5,0,5,0$. The left side of equation (2) is 0 when $x pmod6equiv0$. The right side of equation (2) is 5 when $x pmod6equiv1$. So now all we have to do is solve 5 Chinese remainder theorem problems
$$beginmatrix
6a & 5b\
6a & 5b+2\
6a & 5b+4\
6a+1 & 5b+1\
6a+1 & 5b+3\
endmatrix$$
The result is $x=30p+q$ where $qin0,1,12,13,24$. In order to get the values for $N$, x has multiplied by 30 then added to y. So $$N=900p+30q+y$$ or the last two digits of $2N$ and $S$ are the same iff
$$Npmod900equiv0,1,2,3,4,30,31,32,33,34,360,361,362,363,364,390,391,392,393,394,720,721,722,723,724$$
Edit: when I first saw this problem I misinterpreted it and thought that there were two $S$'s one for N and one for $2N$ and the goal was to get the last two digits of the $S$'s the same. I managed to solve that problem as well. The solution to that problem is below in case anyone is interested.
Let $F_5$ be the last two digits of $2N$ in base 5 but treating it as a base 10 integer.
Let $F_6$ be the last two digits of $2N$ in base 6 but treating it as a base 10 integer.
Our goal then is to find when $$I_5+I_6=F_5+F_6quad (3)$$
With some simple algebra (3) can be rewritten as
$$F_5-I_5=I_6-F_6 (4)$$
The chart directly below shows all possible values of $F_5$ and $I_5$ and the difference between them. (In order of $I_5$ values)
$$
beginarrayr
F_5 & I_5 & F_5-I_5\
hline
00 & 00 & 0\
02 & 01 & 1\
04 & 02 & 2\
11 & 03 & 8\
13 & 04 & 9\
20 & 10 & 10\
22 & 11 & 11\
24 & 12 & 12\
31 & 13 & 18\
33 & 14 & 19\
40 & 20 & 20\
42 & 21 & 21\
44 & 22 & 22\
01 & 23 & -22\
03 & 24 & -21\
10 & 30 & -20\
12 & 31 & -19\
14 & 32 & -18\
21 & 33 & -12\
23 & 34 & -11\
30 & 40 & -10\
32 & 41 & -9\
34 & 42 & -8\
41 & 43 & -2\
43 & 44 & -1\
endarray
$$
The chart directly below shows all possible values of $I_6$ and $F_6$ and the difference between them. (In order of $I_6$ values)
$$
beginarrayr
I_6 & F_6 & I_6-F_6\
hline
00 & 00 & 0\
01 & 02 & -1\
02 & 04 & -2\
03 & 10 & -7\
04 & 12 & -8\
05 & 14 & -9\
10 & 20 & -10\
11 & 22 & -11\
12 & 24 & -12\
13 & 30 & -17\
14 & 32 & -18\
15 & 34 & -19\
20 & 40 & -20\
21 & 42 & -21\
22 & 44 & -22\
23 & 50 & -27\
24 & 52 & -28\
25 & 54 & -29\
30 & 00 & 30\
31 & 02 & 29\
32 & 04 & 28\
33 & 10 & 23\
34 & 12 & 22\
35 & 14 & 21\
40 & 20 & 20\
41 & 22 & 19\
42 & 24 & 18\
43 & 30 & 13\
44 & 32 & 12\
45 & 34 & 11\
50 & 40 & 10\
51 & 42 & 9\
52 & 44 & 8\
53 & 50 & 3\
54 & 52 & 2\
55 & 54 & 1\
endarray
$$
Now we just have to match the difference values of the two charts using modular arithmetic. In the first chart the values cycle every 25 numbers so the rows of the first chart corresponds with $Npmod25$. In the second chart the values cycle every 36 numbers so the rows of the second chart corresponds with $Npmod36$.
If the following rules are applied in order they can be used to determine if the last two digits of $S$ obtained from $2N$ will match the last two digits of $S$ obtained from $N$.
Rule 1: If $N equiv 3pmod6$ then the digits will not match
Rule 2: If $Npmod25+Npmod36=0$ then the digits will match
Rule 3: If $$1le Npmod36le 14$$ and $$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=25$$ the digits will match
Rule 4: If
$$22le Npmod36$$
and
$$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=30$$
the digits will match
Rule 5: in any other case the digits will not match
answered Mar 24 at 23:03
quantus14quantus14
1,41211010
$endgroup$
$begingroup$
Thank you very much! Your help is appreciated!
$endgroup$
– Max0815
Mar 25 at 15:26
add a comment |
$begingroup$
Let $I_5$ be the last two digits of $N$ in base 5 but treating it as a base 10 integer.
Let $I_6$ be the last two digits of $N$ in base 6 but treating it as a base 10 integer.
The largest number $I_5$ can be is 44. The largest number $I_6$ can be is 55. So this means that the sum of the two can be no bigger than 99. This implies that there is no overflow problem into the third digit when adding the two numbers. In fact no digit pair will ever carry into the next digit.The reason for this is the digit range of the base 5 number is 0-4 and the digit range of the base 6 number is 0-5. The sum of which is 0-9.
$I_5$ cycles every 25 numbers. $I_6$ cycles every 36 numbers. The last two digits of $N$ cycles every 100 numbers. The lcm of 25,36,and 100 is 900. This means that the numbers that will produce equality for the two right most digits of $2N$ and $S$ will be in a cycle of 900. The op has already shown that the numbers must be of the form $30x+y$ where $x,yinBbbNspace|space 0le yle 4$. Since digit matchings are independent. If a $30x$ number matches the tens digit for $2N$ and $S$ then all numbers $30x+y$ numbers (for the same $x$) will match both digits. Putting all of this together; only the tens digit of multiples of 30 of $N$ less than 900 have to be examined. The equation that we want to solve is this: $$I_5+I_6=2Npmod100$$ $$equivalently$$
$$I_5+I_6=60xpmod100$$
If we focus on the tens digit we can change the problem to this:
$$xpmod5+(6-x)pmod6equiv6xpmod10quadquadquad(1)$$
Then move the left most term to the right side:
$$(6-x)pmod6equiv6xpmod10-xpmod5quadquadquad(2)$$
What is good about equation (2) is that the result of the right side has the following 5 number sequence $0,5,0,5,0$. The left side of equation (2) is 0 when $x pmod6equiv0$. The right side of equation (2) is 5 when $x pmod6equiv1$. So now all we have to do is solve 5 Chinese remainder theorem problems
$$beginmatrix
6a & 5b\
6a & 5b+2\
6a & 5b+4\
6a+1 & 5b+1\
6a+1 & 5b+3\
endmatrix$$
The result is $x=30p+q$ where $qin0,1,12,13,24$. In order to get the values for $N$, x has multiplied by 30 then added to y. So $$N=900p+30q+y$$ or the last two digits of $2N$ and $S$ are the same iff
$$Npmod900equiv0,1,2,3,4,30,31,32,33,34,360,361,362,363,364,390,391,392,393,394,720,721,722,723,724$$
Edit: when I first saw this problem I misinterpreted it and thought that there were two $S$'s one for N and one for $2N$ and the goal was to get the last two digits of the $S$'s the same. I managed to solve that problem as well. The solution to that problem is below in case anyone is interested.
Let $F_5$ be the last two digits of $2N$ in base 5 but treating it as a base 10 integer.
Let $F_6$ be the last two digits of $2N$ in base 6 but treating it as a base 10 integer.
Our goal then is to find when $$I_5+I_6=F_5+F_6quad (3)$$
With some simple algebra (3) can be rewritten as
$$F_5-I_5=I_6-F_6 (4)$$
The chart directly below shows all possible values of $F_5$ and $I_5$ and the difference between them. (In order of $I_5$ values)
$$
beginarrayr
F_5 & I_5 & F_5-I_5\
hline
00 & 00 & 0\
02 & 01 & 1\
04 & 02 & 2\
11 & 03 & 8\
13 & 04 & 9\
20 & 10 & 10\
22 & 11 & 11\
24 & 12 & 12\
31 & 13 & 18\
33 & 14 & 19\
40 & 20 & 20\
42 & 21 & 21\
44 & 22 & 22\
01 & 23 & -22\
03 & 24 & -21\
10 & 30 & -20\
12 & 31 & -19\
14 & 32 & -18\
21 & 33 & -12\
23 & 34 & -11\
30 & 40 & -10\
32 & 41 & -9\
34 & 42 & -8\
41 & 43 & -2\
43 & 44 & -1\
endarray
$$
The chart directly below shows all possible values of $I_6$ and $F_6$ and the difference between them. (In order of $I_6$ values)
$$
beginarrayr
I_6 & F_6 & I_6-F_6\
hline
00 & 00 & 0\
01 & 02 & -1\
02 & 04 & -2\
03 & 10 & -7\
04 & 12 & -8\
05 & 14 & -9\
10 & 20 & -10\
11 & 22 & -11\
12 & 24 & -12\
13 & 30 & -17\
14 & 32 & -18\
15 & 34 & -19\
20 & 40 & -20\
21 & 42 & -21\
22 & 44 & -22\
23 & 50 & -27\
24 & 52 & -28\
25 & 54 & -29\
30 & 00 & 30\
31 & 02 & 29\
32 & 04 & 28\
33 & 10 & 23\
34 & 12 & 22\
35 & 14 & 21\
40 & 20 & 20\
41 & 22 & 19\
42 & 24 & 18\
43 & 30 & 13\
44 & 32 & 12\
45 & 34 & 11\
50 & 40 & 10\
51 & 42 & 9\
52 & 44 & 8\
53 & 50 & 3\
54 & 52 & 2\
55 & 54 & 1\
endarray
$$
Now we just have to match the difference values of the two charts using modular arithmetic. In the first chart the values cycle every 25 numbers so the rows of the first chart corresponds with $Npmod25$. In the second chart the values cycle every 36 numbers so the rows of the second chart corresponds with $Npmod36$.
If the following rules are applied in order they can be used to determine if the last two digits of $S$ obtained from $2N$ will match the last two digits of $S$ obtained from $N$.
Rule 1: If $N equiv 3pmod6$ then the digits will not match
Rule 2: If $Npmod25+Npmod36=0$ then the digits will match
Rule 3: If $$1le Npmod36le 14$$ and $$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=25$$ the digits will match
Rule 4: If
$$22le Npmod36$$
and
$$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=30$$
the digits will match
Rule 5: in any other case the digits will not match
answered Mar 24 at 23:03
quantus14quantus14
1,41211010
$endgroup$
Let $I_5$ be the last two digits of $N$ in base 5 but treating it as a base 10 integer.
Let $I_6$ be the last two digits of $N$ in base 6 but treating it as a base 10 integer.
The largest number $I_5$ can be is 44. The largest number $I_6$ can be is 55. So this means that the sum of the two can be no bigger than 99. This implies that there is no overflow problem into the third digit when adding the two numbers. In fact no digit pair will ever carry into the next digit.The reason for this is the digit range of the base 5 number is 0-4 and the digit range of the base 6 number is 0-5. The sum of which is 0-9.
$I_5$ cycles every 25 numbers. $I_6$ cycles every 36 numbers. The last two digits of $N$ cycles every 100 numbers. The lcm of 25,36,and 100 is 900. This means that the numbers that will produce equality for the two right most digits of $2N$ and $S$ will be in a cycle of 900. The op has already shown that the numbers must be of the form $30x+y$ where $x,yinBbbNspace|space 0le yle 4$. Since digit matchings are independent. If a $30x$ number matches the tens digit for $2N$ and $S$ then all numbers $30x+y$ numbers (for the same $x$) will match both digits. Putting all of this together; only the tens digit of multiples of 30 of $N$ less than 900 have to be examined. The equation that we want to solve is this: $$I_5+I_6=2Npmod100$$ $$equivalently$$
$$I_5+I_6=60xpmod100$$
If we focus on the tens digit we can change the problem to this:
$$xpmod5+(6-x)pmod6equiv6xpmod10quadquadquad(1)$$
Then move the left most term to the right side:
$$(6-x)pmod6equiv6xpmod10-xpmod5quadquadquad(2)$$
What is good about equation (2) is that the result of the right side has the following 5 number sequence $0,5,0,5,0$. The left side of equation (2) is 0 when $x pmod6equiv0$. The right side of equation (2) is 5 when $x pmod6equiv1$. So now all we have to do is solve 5 Chinese remainder theorem problems
$$beginmatrix
6a & 5b\
6a & 5b+2\
6a & 5b+4\
6a+1 & 5b+1\
6a+1 & 5b+3\
endmatrix$$
The result is $x=30p+q$ where $qin0,1,12,13,24$. In order to get the values for $N$, x has multiplied by 30 then added to y. So $$N=900p+30q+y$$ or the last two digits of $2N$ and $S$ are the same iff
$$Npmod900equiv0,1,2,3,4,30,31,32,33,34,360,361,362,363,364,390,391,392,393,394,720,721,722,723,724$$
Edit: when I first saw this problem I misinterpreted it and thought that there were two $S$'s one for N and one for $2N$ and the goal was to get the last two digits of the $S$'s the same. I managed to solve that problem as well. The solution to that problem is below in case anyone is interested.
Let $F_5$ be the last two digits of $2N$ in base 5 but treating it as a base 10 integer.
Let $F_6$ be the last two digits of $2N$ in base 6 but treating it as a base 10 integer.
Our goal then is to find when $$I_5+I_6=F_5+F_6quad (3)$$
With some simple algebra (3) can be rewritten as
$$F_5-I_5=I_6-F_6 (4)$$
The chart directly below shows all possible values of $F_5$ and $I_5$ and the difference between them. (In order of $I_5$ values)
$$
beginarrayr
F_5 & I_5 & F_5-I_5\
hline
00 & 00 & 0\
02 & 01 & 1\
04 & 02 & 2\
11 & 03 & 8\
13 & 04 & 9\
20 & 10 & 10\
22 & 11 & 11\
24 & 12 & 12\
31 & 13 & 18\
33 & 14 & 19\
40 & 20 & 20\
42 & 21 & 21\
44 & 22 & 22\
01 & 23 & -22\
03 & 24 & -21\
10 & 30 & -20\
12 & 31 & -19\
14 & 32 & -18\
21 & 33 & -12\
23 & 34 & -11\
30 & 40 & -10\
32 & 41 & -9\
34 & 42 & -8\
41 & 43 & -2\
43 & 44 & -1\
endarray
$$
The chart directly below shows all possible values of $I_6$ and $F_6$ and the difference between them. (In order of $I_6$ values)
$$
beginarrayr
I_6 & F_6 & I_6-F_6\
hline
00 & 00 & 0\
01 & 02 & -1\
02 & 04 & -2\
03 & 10 & -7\
04 & 12 & -8\
05 & 14 & -9\
10 & 20 & -10\
11 & 22 & -11\
12 & 24 & -12\
13 & 30 & -17\
14 & 32 & -18\
15 & 34 & -19\
20 & 40 & -20\
21 & 42 & -21\
22 & 44 & -22\
23 & 50 & -27\
24 & 52 & -28\
25 & 54 & -29\
30 & 00 & 30\
31 & 02 & 29\
32 & 04 & 28\
33 & 10 & 23\
34 & 12 & 22\
35 & 14 & 21\
40 & 20 & 20\
41 & 22 & 19\
42 & 24 & 18\
43 & 30 & 13\
44 & 32 & 12\
45 & 34 & 11\
50 & 40 & 10\
51 & 42 & 9\
52 & 44 & 8\
53 & 50 & 3\
54 & 52 & 2\
55 & 54 & 1\
endarray
$$
Now we just have to match the difference values of the two charts using modular arithmetic. In the first chart the values cycle every 25 numbers so the rows of the first chart corresponds with $Npmod25$. In the second chart the values cycle every 36 numbers so the rows of the second chart corresponds with $Npmod36$.
If the following rules are applied in order they can be used to determine if the last two digits of $S$ obtained from $2N$ will match the last two digits of $S$ obtained from $N$.
Rule 1: If $N equiv 3pmod6$ then the digits will not match
Rule 2: If $Npmod25+Npmod36=0$ then the digits will match
Rule 3: If $$1le Npmod36le 14$$ and $$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=25$$ the digits will match
Rule 4: If
$$22le Npmod36$$
and
$$Npmod25+Npmod36-leftlfloorfracNpmod36+36rightrfloor=30$$
the digits will match
Rule 5: in any other case the digits will not match
answered Mar 24 at 23:03
quantus14quantus14
1,41211010
edited Mar 25 at 15:21
answered Mar 24 at 23:03
quantus14quantus14
1,41211010
answered Mar 24 at 23:03
quantus14quantus14
1,41211010
answered Mar 24 at 23:03
quantus14quantus14
1,41211010
1,41211010
$begingroup$
Thank you very much! Your help is appreciated!
$endgroup$
– Max0815
Mar 25 at 15:26
add a comment |
$begingroup$
Thank you very much! Your help is appreciated!
$endgroup$
– Max0815
Mar 25 at 15:26
$begingroup$
Thank you very much! Your help is appreciated!
$endgroup$
– Max0815
Mar 25 at 15:26
$begingroup$
Thank you very much! Your help is appreciated!
$endgroup$
– Max0815
Mar 25 at 15:26
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3098173%2fns-base-5-and-base-6-representations-treated-as-base-10-yield-sum-s-for%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
