limit in p-adic number system 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)Representing a fraction as a $p$-adic numberp-adic expansion of a rational numberCondition inverse $p$-adic number7-adic expansion of a rational number1/p in p-adic number system?Limit of p-adic numbersp-adic number for polynomialP adic numbers number theoryWhat is the characteristic of p-adic number fields?Computing quotient by dividing formally in $p$-adic number system
Change bounding box of math glyphs in LuaTeX
Is it ok to offer lower paid work as a trial period before negotiating for a full-time job?
The variadic template constructor of my class cannot modify my class members, why is that so?
Is there a writing software that you can sort scenes like slides in PowerPoint?
Relations between two reciprocal partial derivatives?
What aspect of planet Earth must be changed to prevent the industrial revolution?
Sort list of array linked objects by keys and values
How does this infinite series simplify to an integral?
Simulating Exploding Dice
First use of “packing” as in carrying a gun
I could not break this equation. Please help me
Did the new image of black hole confirm the general theory of relativity?
How are presidential pardons supposed to be used?
Match Roman Numerals
How to prevent selfdestruct from another contract
Can withdrawing asylum be illegal?
Why can't wing-mounted spoilers be used to steepen approaches?
What do you call a plan that's an alternative plan in case your initial plan fails?
A pet rabbit called Belle
Are spiders unable to hurt humans, especially very small spiders?
How to grep and cut numbes from a file and sum them
Do working physicists consider Newtonian mechanics to be "falsified"?
Does Parliament hold absolute power in the UK?
Python - Fishing Simulator
limit in p-adic number system
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)Representing a fraction as a $p$-adic numberp-adic expansion of a rational numberCondition inverse $p$-adic number7-adic expansion of a rational number1/p in p-adic number system?Limit of p-adic numbersp-adic number for polynomialP adic numbers number theoryWhat is the characteristic of p-adic number fields?Computing quotient by dividing formally in $p$-adic number system
$begingroup$
Please give me a hint for limit of $lim_ntoinfty3^2^n$ in $mathbb Q_5$.
First, new absolute value $|cdot|'$ on $mathbb Q$ is defined as the following:
For $fracnmin mathbb Q$,$$|fracnm|'=5^-v$$
if $fracnm=5^vp_1^v_1p_2^v_2p_3^v_3...p_r^v_r$ where $p_i$: distinct prime number without 5 and $v_iinmathbb Z$.
Then, the absolute value satisfies $|r|'=0
Leftrightarrow r=0$ and triangle inequiality. Secondly, based on this absolute value and equivalence relation for Cauchy sequence, new $mathbb Q_5$
system is constructed.
number-theory p-adic-number-theory
$endgroup$
|
show 5 more comments
$begingroup$
Please give me a hint for limit of $lim_ntoinfty3^2^n$ in $mathbb Q_5$.
First, new absolute value $|cdot|'$ on $mathbb Q$ is defined as the following:
For $fracnmin mathbb Q$,$$|fracnm|'=5^-v$$
if $fracnm=5^vp_1^v_1p_2^v_2p_3^v_3...p_r^v_r$ where $p_i$: distinct prime number without 5 and $v_iinmathbb Z$.
Then, the absolute value satisfies $|r|'=0
Leftrightarrow r=0$ and triangle inequiality. Secondly, based on this absolute value and equivalence relation for Cauchy sequence, new $mathbb Q_5$
system is constructed.
number-theory p-adic-number-theory
$endgroup$
$begingroup$
$3^2^2 equiv 3^2^5 equiv 6 bmod 25$
$endgroup$
– reuns
Mar 31 at 14:24
$begingroup$
Do you see why it answers your question ? What is $|3^2^2-3^2^3|$ and $|3^2^3n+2-(3^2^3n+3)|$ ?
$endgroup$
– reuns
Mar 31 at 16:33
$begingroup$
No $|6-36|= ? $. For the $2^2n+2$ see my first comment indicating the sequence $x_n = 3^2^n=x_n-1^2bmod 25$ is $3$-periodic
$endgroup$
– reuns
Mar 31 at 17:00
1
$begingroup$
No $|-30|= |-6| |5|= |5| = 1/5$. It is a norm, no negative values
$endgroup$
– reuns
Mar 31 at 17:07
1
$begingroup$
Because $x_n = x_n-1^2$ is a recurrence with one-backward lookup. So $x_0 = x_3$ implies...
$endgroup$
– reuns
Mar 31 at 17:39
|
show 5 more comments
$begingroup$
Please give me a hint for limit of $lim_ntoinfty3^2^n$ in $mathbb Q_5$.
First, new absolute value $|cdot|'$ on $mathbb Q$ is defined as the following:
For $fracnmin mathbb Q$,$$|fracnm|'=5^-v$$
if $fracnm=5^vp_1^v_1p_2^v_2p_3^v_3...p_r^v_r$ where $p_i$: distinct prime number without 5 and $v_iinmathbb Z$.
Then, the absolute value satisfies $|r|'=0
Leftrightarrow r=0$ and triangle inequiality. Secondly, based on this absolute value and equivalence relation for Cauchy sequence, new $mathbb Q_5$
system is constructed.
number-theory p-adic-number-theory
$endgroup$
Please give me a hint for limit of $lim_ntoinfty3^2^n$ in $mathbb Q_5$.
First, new absolute value $|cdot|'$ on $mathbb Q$ is defined as the following:
For $fracnmin mathbb Q$,$$|fracnm|'=5^-v$$
if $fracnm=5^vp_1^v_1p_2^v_2p_3^v_3...p_r^v_r$ where $p_i$: distinct prime number without 5 and $v_iinmathbb Z$.
Then, the absolute value satisfies $|r|'=0
Leftrightarrow r=0$ and triangle inequiality. Secondly, based on this absolute value and equivalence relation for Cauchy sequence, new $mathbb Q_5$
system is constructed.
number-theory p-adic-number-theory
number-theory p-adic-number-theory
edited Mar 31 at 19:56
Martin Hansen
836115
836115
asked Mar 31 at 13:13
dlfjsemfdlfjsemf
988
988
$begingroup$
$3^2^2 equiv 3^2^5 equiv 6 bmod 25$
$endgroup$
– reuns
Mar 31 at 14:24
$begingroup$
Do you see why it answers your question ? What is $|3^2^2-3^2^3|$ and $|3^2^3n+2-(3^2^3n+3)|$ ?
$endgroup$
– reuns
Mar 31 at 16:33
$begingroup$
No $|6-36|= ? $. For the $2^2n+2$ see my first comment indicating the sequence $x_n = 3^2^n=x_n-1^2bmod 25$ is $3$-periodic
$endgroup$
– reuns
Mar 31 at 17:00
1
$begingroup$
No $|-30|= |-6| |5|= |5| = 1/5$. It is a norm, no negative values
$endgroup$
– reuns
Mar 31 at 17:07
1
$begingroup$
Because $x_n = x_n-1^2$ is a recurrence with one-backward lookup. So $x_0 = x_3$ implies...
$endgroup$
– reuns
Mar 31 at 17:39
|
show 5 more comments
$begingroup$
$3^2^2 equiv 3^2^5 equiv 6 bmod 25$
$endgroup$
– reuns
Mar 31 at 14:24
$begingroup$
Do you see why it answers your question ? What is $|3^2^2-3^2^3|$ and $|3^2^3n+2-(3^2^3n+3)|$ ?
$endgroup$
– reuns
Mar 31 at 16:33
$begingroup$
No $|6-36|= ? $. For the $2^2n+2$ see my first comment indicating the sequence $x_n = 3^2^n=x_n-1^2bmod 25$ is $3$-periodic
$endgroup$
– reuns
Mar 31 at 17:00
1
$begingroup$
No $|-30|= |-6| |5|= |5| = 1/5$. It is a norm, no negative values
$endgroup$
– reuns
Mar 31 at 17:07
1
$begingroup$
Because $x_n = x_n-1^2$ is a recurrence with one-backward lookup. So $x_0 = x_3$ implies...
$endgroup$
– reuns
Mar 31 at 17:39
$begingroup$
$3^2^2 equiv 3^2^5 equiv 6 bmod 25$
$endgroup$
– reuns
Mar 31 at 14:24
$begingroup$
$3^2^2 equiv 3^2^5 equiv 6 bmod 25$
$endgroup$
– reuns
Mar 31 at 14:24
$begingroup$
Do you see why it answers your question ? What is $|3^2^2-3^2^3|$ and $|3^2^3n+2-(3^2^3n+3)|$ ?
$endgroup$
– reuns
Mar 31 at 16:33
$begingroup$
Do you see why it answers your question ? What is $|3^2^2-3^2^3|$ and $|3^2^3n+2-(3^2^3n+3)|$ ?
$endgroup$
– reuns
Mar 31 at 16:33
$begingroup$
No $|6-36|= ? $. For the $2^2n+2$ see my first comment indicating the sequence $x_n = 3^2^n=x_n-1^2bmod 25$ is $3$-periodic
$endgroup$
– reuns
Mar 31 at 17:00
$begingroup$
No $|6-36|= ? $. For the $2^2n+2$ see my first comment indicating the sequence $x_n = 3^2^n=x_n-1^2bmod 25$ is $3$-periodic
$endgroup$
– reuns
Mar 31 at 17:00
1
1
$begingroup$
No $|-30|= |-6| |5|= |5| = 1/5$. It is a norm, no negative values
$endgroup$
– reuns
Mar 31 at 17:07
$begingroup$
No $|-30|= |-6| |5|= |5| = 1/5$. It is a norm, no negative values
$endgroup$
– reuns
Mar 31 at 17:07
1
1
$begingroup$
Because $x_n = x_n-1^2$ is a recurrence with one-backward lookup. So $x_0 = x_3$ implies...
$endgroup$
– reuns
Mar 31 at 17:39
$begingroup$
Because $x_n = x_n-1^2$ is a recurrence with one-backward lookup. So $x_0 = x_3$ implies...
$endgroup$
– reuns
Mar 31 at 17:39
|
show 5 more comments
3 Answers
3
active
oldest
votes
$begingroup$
This is a moderately delicate question. Let’s look at $3^2^n+2$ modulo $25$. We have:
$$
3^2^n+2=3^4cdot2^n=81^2^n=(1+5cdot16)^2^nequiv(1+5)^2^nequiv1+2^ncdot5pmod25
$$
Now, you can check that for $nequiv0,1,2,3pmod4$, you get $2^nequiv1,2,4,3pmod5$ respectively, in other words, $3^2^n+2equiv6,11,21,16pmod25$ respectively, so there’s nothing like a limit here.
In fact the situation is even worse (or better, depending on your taste). Using the $5$-adic logarithm, you can show that when you restrict to values of $nequiv0pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $6+25Bbb Z_5$, and similarly for $nequiv1pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $11+25Bbb Z_5$, etc. But this density question involves more work than you want to see now.
The moral is: no limit.
$endgroup$
add a comment |
$begingroup$
By repeated squaring we have $3^4equiv 6bmod 25$, $3^8equiv 11$, $3^16equiv 21$, $3^32equiv 16$, $3^64equiv 6$ so the expression cycles $bmod 25$. The terms in the cycle differ by amounts having $5$-adic norm $1/5$ which never goes to zero. So there cannot be a $5$-adic limit.
$endgroup$
1
$begingroup$
As an old hand at this $p$-adic racket, I would say that it looks highly improbable that there could be any satisfactory limit here.
$endgroup$
– Lubin
Mar 31 at 22:37
$begingroup$
Similarly the decimal number $0.9999999...$ does not equal $1$ in the $3$-adic metric because the series it represents does not converge.
$endgroup$
– Oscar Lanzi
Mar 31 at 23:29
1
$begingroup$
Your argument is quicker than mine, but the cycling is even more fractal, if you will: there’s cycling modulo $125$ as well. And modulo $625$, $3125$, etc.
$endgroup$
– Lubin
Apr 1 at 4:24
add a comment |
$begingroup$
Since you're repeatedly squaring in the limit, if the limit exists,
$$lim_nto infty 3^2^n = L$$
then it must end up satisfying $L^2=L$. So either L=0 or L=1. It's not 0 because 3 is not divisible by 5, so it must be 1 if it exists. That means this limit must be zero:
$$lim_n to infty 3^2^n - 1 = 0$$
We can factor that pretty easily by a geometric series, for reference:
$$frac3^2^n-13-1 = sum_k=0^2^n-1 3^k$$
so we can rewrite the previous limit as,
$$lim_n to infty 2*sum_k=0^2^n-1 3^k = 0$$
in the limit if this sum converges (it doesn't), it should converge to:
$$2 * frac11-3$$
which is not 0, so the limit does not exist.
$endgroup$
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%2f3169376%2flimit-in-p-adic-number-system%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This is a moderately delicate question. Let’s look at $3^2^n+2$ modulo $25$. We have:
$$
3^2^n+2=3^4cdot2^n=81^2^n=(1+5cdot16)^2^nequiv(1+5)^2^nequiv1+2^ncdot5pmod25
$$
Now, you can check that for $nequiv0,1,2,3pmod4$, you get $2^nequiv1,2,4,3pmod5$ respectively, in other words, $3^2^n+2equiv6,11,21,16pmod25$ respectively, so there’s nothing like a limit here.
In fact the situation is even worse (or better, depending on your taste). Using the $5$-adic logarithm, you can show that when you restrict to values of $nequiv0pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $6+25Bbb Z_5$, and similarly for $nequiv1pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $11+25Bbb Z_5$, etc. But this density question involves more work than you want to see now.
The moral is: no limit.
$endgroup$
add a comment |
$begingroup$
This is a moderately delicate question. Let’s look at $3^2^n+2$ modulo $25$. We have:
$$
3^2^n+2=3^4cdot2^n=81^2^n=(1+5cdot16)^2^nequiv(1+5)^2^nequiv1+2^ncdot5pmod25
$$
Now, you can check that for $nequiv0,1,2,3pmod4$, you get $2^nequiv1,2,4,3pmod5$ respectively, in other words, $3^2^n+2equiv6,11,21,16pmod25$ respectively, so there’s nothing like a limit here.
In fact the situation is even worse (or better, depending on your taste). Using the $5$-adic logarithm, you can show that when you restrict to values of $nequiv0pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $6+25Bbb Z_5$, and similarly for $nequiv1pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $11+25Bbb Z_5$, etc. But this density question involves more work than you want to see now.
The moral is: no limit.
$endgroup$
add a comment |
$begingroup$
This is a moderately delicate question. Let’s look at $3^2^n+2$ modulo $25$. We have:
$$
3^2^n+2=3^4cdot2^n=81^2^n=(1+5cdot16)^2^nequiv(1+5)^2^nequiv1+2^ncdot5pmod25
$$
Now, you can check that for $nequiv0,1,2,3pmod4$, you get $2^nequiv1,2,4,3pmod5$ respectively, in other words, $3^2^n+2equiv6,11,21,16pmod25$ respectively, so there’s nothing like a limit here.
In fact the situation is even worse (or better, depending on your taste). Using the $5$-adic logarithm, you can show that when you restrict to values of $nequiv0pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $6+25Bbb Z_5$, and similarly for $nequiv1pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $11+25Bbb Z_5$, etc. But this density question involves more work than you want to see now.
The moral is: no limit.
$endgroup$
This is a moderately delicate question. Let’s look at $3^2^n+2$ modulo $25$. We have:
$$
3^2^n+2=3^4cdot2^n=81^2^n=(1+5cdot16)^2^nequiv(1+5)^2^nequiv1+2^ncdot5pmod25
$$
Now, you can check that for $nequiv0,1,2,3pmod4$, you get $2^nequiv1,2,4,3pmod5$ respectively, in other words, $3^2^n+2equiv6,11,21,16pmod25$ respectively, so there’s nothing like a limit here.
In fact the situation is even worse (or better, depending on your taste). Using the $5$-adic logarithm, you can show that when you restrict to values of $nequiv0pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $6+25Bbb Z_5$, and similarly for $nequiv1pmod4$, the numbers $(1+5cdot16)^2^n$ are dense in $11+25Bbb Z_5$, etc. But this density question involves more work than you want to see now.
The moral is: no limit.
answered Apr 1 at 4:18
LubinLubin
45.5k44688
45.5k44688
add a comment |
add a comment |
$begingroup$
By repeated squaring we have $3^4equiv 6bmod 25$, $3^8equiv 11$, $3^16equiv 21$, $3^32equiv 16$, $3^64equiv 6$ so the expression cycles $bmod 25$. The terms in the cycle differ by amounts having $5$-adic norm $1/5$ which never goes to zero. So there cannot be a $5$-adic limit.
$endgroup$
1
$begingroup$
As an old hand at this $p$-adic racket, I would say that it looks highly improbable that there could be any satisfactory limit here.
$endgroup$
– Lubin
Mar 31 at 22:37
$begingroup$
Similarly the decimal number $0.9999999...$ does not equal $1$ in the $3$-adic metric because the series it represents does not converge.
$endgroup$
– Oscar Lanzi
Mar 31 at 23:29
1
$begingroup$
Your argument is quicker than mine, but the cycling is even more fractal, if you will: there’s cycling modulo $125$ as well. And modulo $625$, $3125$, etc.
$endgroup$
– Lubin
Apr 1 at 4:24
add a comment |
$begingroup$
By repeated squaring we have $3^4equiv 6bmod 25$, $3^8equiv 11$, $3^16equiv 21$, $3^32equiv 16$, $3^64equiv 6$ so the expression cycles $bmod 25$. The terms in the cycle differ by amounts having $5$-adic norm $1/5$ which never goes to zero. So there cannot be a $5$-adic limit.
$endgroup$
1
$begingroup$
As an old hand at this $p$-adic racket, I would say that it looks highly improbable that there could be any satisfactory limit here.
$endgroup$
– Lubin
Mar 31 at 22:37
$begingroup$
Similarly the decimal number $0.9999999...$ does not equal $1$ in the $3$-adic metric because the series it represents does not converge.
$endgroup$
– Oscar Lanzi
Mar 31 at 23:29
1
$begingroup$
Your argument is quicker than mine, but the cycling is even more fractal, if you will: there’s cycling modulo $125$ as well. And modulo $625$, $3125$, etc.
$endgroup$
– Lubin
Apr 1 at 4:24
add a comment |
$begingroup$
By repeated squaring we have $3^4equiv 6bmod 25$, $3^8equiv 11$, $3^16equiv 21$, $3^32equiv 16$, $3^64equiv 6$ so the expression cycles $bmod 25$. The terms in the cycle differ by amounts having $5$-adic norm $1/5$ which never goes to zero. So there cannot be a $5$-adic limit.
$endgroup$
By repeated squaring we have $3^4equiv 6bmod 25$, $3^8equiv 11$, $3^16equiv 21$, $3^32equiv 16$, $3^64equiv 6$ so the expression cycles $bmod 25$. The terms in the cycle differ by amounts having $5$-adic norm $1/5$ which never goes to zero. So there cannot be a $5$-adic limit.
answered Mar 31 at 19:27
Oscar LanziOscar Lanzi
13.6k12136
13.6k12136
1
$begingroup$
As an old hand at this $p$-adic racket, I would say that it looks highly improbable that there could be any satisfactory limit here.
$endgroup$
– Lubin
Mar 31 at 22:37
$begingroup$
Similarly the decimal number $0.9999999...$ does not equal $1$ in the $3$-adic metric because the series it represents does not converge.
$endgroup$
– Oscar Lanzi
Mar 31 at 23:29
1
$begingroup$
Your argument is quicker than mine, but the cycling is even more fractal, if you will: there’s cycling modulo $125$ as well. And modulo $625$, $3125$, etc.
$endgroup$
– Lubin
Apr 1 at 4:24
add a comment |
1
$begingroup$
As an old hand at this $p$-adic racket, I would say that it looks highly improbable that there could be any satisfactory limit here.
$endgroup$
– Lubin
Mar 31 at 22:37
$begingroup$
Similarly the decimal number $0.9999999...$ does not equal $1$ in the $3$-adic metric because the series it represents does not converge.
$endgroup$
– Oscar Lanzi
Mar 31 at 23:29
1
$begingroup$
Your argument is quicker than mine, but the cycling is even more fractal, if you will: there’s cycling modulo $125$ as well. And modulo $625$, $3125$, etc.
$endgroup$
– Lubin
Apr 1 at 4:24
1
1
$begingroup$
As an old hand at this $p$-adic racket, I would say that it looks highly improbable that there could be any satisfactory limit here.
$endgroup$
– Lubin
Mar 31 at 22:37
$begingroup$
As an old hand at this $p$-adic racket, I would say that it looks highly improbable that there could be any satisfactory limit here.
$endgroup$
– Lubin
Mar 31 at 22:37
$begingroup$
Similarly the decimal number $0.9999999...$ does not equal $1$ in the $3$-adic metric because the series it represents does not converge.
$endgroup$
– Oscar Lanzi
Mar 31 at 23:29
$begingroup$
Similarly the decimal number $0.9999999...$ does not equal $1$ in the $3$-adic metric because the series it represents does not converge.
$endgroup$
– Oscar Lanzi
Mar 31 at 23:29
1
1
$begingroup$
Your argument is quicker than mine, but the cycling is even more fractal, if you will: there’s cycling modulo $125$ as well. And modulo $625$, $3125$, etc.
$endgroup$
– Lubin
Apr 1 at 4:24
$begingroup$
Your argument is quicker than mine, but the cycling is even more fractal, if you will: there’s cycling modulo $125$ as well. And modulo $625$, $3125$, etc.
$endgroup$
– Lubin
Apr 1 at 4:24
add a comment |
$begingroup$
Since you're repeatedly squaring in the limit, if the limit exists,
$$lim_nto infty 3^2^n = L$$
then it must end up satisfying $L^2=L$. So either L=0 or L=1. It's not 0 because 3 is not divisible by 5, so it must be 1 if it exists. That means this limit must be zero:
$$lim_n to infty 3^2^n - 1 = 0$$
We can factor that pretty easily by a geometric series, for reference:
$$frac3^2^n-13-1 = sum_k=0^2^n-1 3^k$$
so we can rewrite the previous limit as,
$$lim_n to infty 2*sum_k=0^2^n-1 3^k = 0$$
in the limit if this sum converges (it doesn't), it should converge to:
$$2 * frac11-3$$
which is not 0, so the limit does not exist.
$endgroup$
add a comment |
$begingroup$
Since you're repeatedly squaring in the limit, if the limit exists,
$$lim_nto infty 3^2^n = L$$
then it must end up satisfying $L^2=L$. So either L=0 or L=1. It's not 0 because 3 is not divisible by 5, so it must be 1 if it exists. That means this limit must be zero:
$$lim_n to infty 3^2^n - 1 = 0$$
We can factor that pretty easily by a geometric series, for reference:
$$frac3^2^n-13-1 = sum_k=0^2^n-1 3^k$$
so we can rewrite the previous limit as,
$$lim_n to infty 2*sum_k=0^2^n-1 3^k = 0$$
in the limit if this sum converges (it doesn't), it should converge to:
$$2 * frac11-3$$
which is not 0, so the limit does not exist.
$endgroup$
add a comment |
$begingroup$
Since you're repeatedly squaring in the limit, if the limit exists,
$$lim_nto infty 3^2^n = L$$
then it must end up satisfying $L^2=L$. So either L=0 or L=1. It's not 0 because 3 is not divisible by 5, so it must be 1 if it exists. That means this limit must be zero:
$$lim_n to infty 3^2^n - 1 = 0$$
We can factor that pretty easily by a geometric series, for reference:
$$frac3^2^n-13-1 = sum_k=0^2^n-1 3^k$$
so we can rewrite the previous limit as,
$$lim_n to infty 2*sum_k=0^2^n-1 3^k = 0$$
in the limit if this sum converges (it doesn't), it should converge to:
$$2 * frac11-3$$
which is not 0, so the limit does not exist.
$endgroup$
Since you're repeatedly squaring in the limit, if the limit exists,
$$lim_nto infty 3^2^n = L$$
then it must end up satisfying $L^2=L$. So either L=0 or L=1. It's not 0 because 3 is not divisible by 5, so it must be 1 if it exists. That means this limit must be zero:
$$lim_n to infty 3^2^n - 1 = 0$$
We can factor that pretty easily by a geometric series, for reference:
$$frac3^2^n-13-1 = sum_k=0^2^n-1 3^k$$
so we can rewrite the previous limit as,
$$lim_n to infty 2*sum_k=0^2^n-1 3^k = 0$$
in the limit if this sum converges (it doesn't), it should converge to:
$$2 * frac11-3$$
which is not 0, so the limit does not exist.
answered Apr 2 at 15:44
user660216user660216
1
1
add a comment |
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%2f3169376%2flimit-in-p-adic-number-system%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
$begingroup$
$3^2^2 equiv 3^2^5 equiv 6 bmod 25$
$endgroup$
– reuns
Mar 31 at 14:24
$begingroup$
Do you see why it answers your question ? What is $|3^2^2-3^2^3|$ and $|3^2^3n+2-(3^2^3n+3)|$ ?
$endgroup$
– reuns
Mar 31 at 16:33
$begingroup$
No $|6-36|= ? $. For the $2^2n+2$ see my first comment indicating the sequence $x_n = 3^2^n=x_n-1^2bmod 25$ is $3$-periodic
$endgroup$
– reuns
Mar 31 at 17:00
1
$begingroup$
No $|-30|= |-6| |5|= |5| = 1/5$. It is a norm, no negative values
$endgroup$
– reuns
Mar 31 at 17:07
1
$begingroup$
Because $x_n = x_n-1^2$ is a recurrence with one-backward lookup. So $x_0 = x_3$ implies...
$endgroup$
– reuns
Mar 31 at 17:39