Yhyjyk

Time travel from stationary position?

Bacteria contamination inside a thermos bottle

Why does overlay work only on the first tcolorbox?

My adviser wants to be the first author

Meme-controlled people

Pauli exclusion principle

Why no Iridium-level flares from other satellites?

Do I need to be arrogant to get ahead?

Bach's Toccata and Fugue in D minor breaks the "no parallel octaves" rule?

Is honey really a supersaturated solution? Does heating to un-crystalize redissolve it or melt it?

This word with a lot of past tenses

Fastest way to pop N items from a large dict

How could an airship be repaired midflight?

How to terminate ping <dest> &

Violin - Can double stops be played when the strings are not next to each other?

What exactly is this small puffer fish doing and how did it manage to accomplish such a feat?

How do I change two letters closest to a string and one letter immediately after a string using Notepad++?

I got the following comment from a reputed math journal. What does it mean?

Passing arguments from one script to another

Is there a hypothetical scenario that would make Earth uninhabitable for humans, but not for (the majority of) other animals?

A diagram about partial derivatives of f(x,y)

Shortcut for setting origin to vertex

Why Choose Less Effective Armour Types?

How to make healing in an exploration game interesting

Does this sum go infinity?

If $a_n$ goes to zero, can we find signs $s_n$ such that $sum s_n a_n$ converges?Asymptotic expansion for harmonic sum in two variablesConvergence of $sum_k=1^n(1-k/n)a_k$Does $sum_n=1^inftyfraccosleft(fracnpi2right)sqrtn$ converge?Bivariate infinite series: explicit sum?some infinite sum and $liminf$Sum of the inverses of numbers with $n$ divisors.Why $sum_n=0^infty (-1)^nx^2n$ converge pointwise?Does this series converge absolutely $sum_n=1^inftyfracb^n_ncos(npi)n$Does $sumlimits_k=1^infty sumlimits_n=k^infty frac(-1)^n+kn$ diverge?

6

3

$begingroup$

Consider $F(x)$ that maps from $Bbb N$ to $pm 1$, such that if $x$ is odd, then $F(x)$ = $$(-1)^(fracx-12)$$, and if $x$ is even, then $F(x)=F(y)$, where $y$ is the odd number obtained after dividing $x$ by $2$ until it is odd.

Does $S_n = sum_p=1^n F(p)$ have an explicit formula?
And if $n$ tends to $infty$ does the sum alternates or will it lie between an interval or does it tend to $pm infty$ ?

sequences-and-series algebra-precalculus

share|cite|improve this question

edited 2 hours ago

Hari Krishna P

asked 2 hours ago

Hari Krishna PHari Krishna P

314

New contributor

Hari Krishna P is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  @Max thanks for the edit....this was my first question on mathstackexchange!
  $endgroup$
  – Hari Krishna P
  2 hours ago
  

  
  
  
  

add a comment | 

6

3

$begingroup$

Consider $F(x)$ that maps from $Bbb N$ to $pm 1$, such that if $x$ is odd, then $F(x)$ = $$(-1)^(fracx-12)$$, and if $x$ is even, then $F(x)=F(y)$, where $y$ is the odd number obtained after dividing $x$ by $2$ until it is odd.

Does $S_n = sum_p=1^n F(p)$ have an explicit formula?
And if $n$ tends to $infty$ does the sum alternates or will it lie between an interval or does it tend to $pm infty$ ?

sequences-and-series algebra-precalculus

share|cite|improve this question

edited 2 hours ago

Hari Krishna P

asked 2 hours ago

Hari Krishna PHari Krishna P

314

New contributor

Hari Krishna P is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  @Max thanks for the edit....this was my first question on mathstackexchange!
  $endgroup$
  – Hari Krishna P
  2 hours ago
  

  
  
  
  

add a comment | 

$begingroup$

Consider $F(x)$ that maps from $Bbb N$ to $pm 1$, such that if $x$ is odd, then $F(x)$ = $$(-1)^(fracx-12)$$, and if $x$ is even, then $F(x)=F(y)$, where $y$ is the odd number obtained after dividing $x$ by $2$ until it is odd.

Does $S_n = sum_p=1^n F(p)$ have an explicit formula?
And if $n$ tends to $infty$ does the sum alternates or will it lie between an interval or does it tend to $pm infty$ ?

sequences-and-series algebra-precalculus

share|cite|improve this question

edited 2 hours ago

Hari Krishna P

asked 2 hours ago

Hari Krishna PHari Krishna P

314

New contributor

Hari Krishna P is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

share|cite|improve this question

edited 2 hours ago

Hari Krishna P

asked 2 hours ago

Hari Krishna PHari Krishna P

314

New contributor

Hari Krishna P is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|cite|improve this question

edited 2 hours ago

Hari Krishna P

asked 2 hours ago

Hari Krishna PHari Krishna P

314

New contributor

Hari Krishna P is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 2 hours ago

Hari Krishna PHari Krishna P

314

New contributor

Hari Krishna P is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 2 hours ago

Hari Krishna PHari Krishna P

314

1 Answer
1

active

oldest

votes

4

$begingroup$

Let $T(n) = sum_ktext is odd, kle nF(k)$. We can easily see that $T(0)=0$, $T(1)=1$, $T(2)=1$, $T(3)=0$, and $T(n+4)=T(n)$ for all $nge 0$. This is $1$ if the last two bits of $n$ (when expressed in binary) are different, and $0$ if they are the same.

Then, $T(lfloor n/2rfloor) = sum_ktext is odd, kle lfloor n/2rfloorF(k)=sum_ktext is odd, 2kle nF(2k)$, $T(lfloor n/4rfloor) = sum_ktext is odd, 4kle nF(4k)$, and so on. Every integer is equal to $2^m k$ for some nonnegative $m$ and odd $k$. As such, we can take a sum, and get
$$S_n = T(n)+T(lfloor n/2rfloor)+T(lfloor n/4rfloor)+cdots = sum_m=0^lfloor log_2 nrfloorT(lfloor n/2^mrfloor)$$
Each term is $1$ if two particular adjacent bits of $n$ are different and zero if they're equal - the $1$ bit and the $2$ bit for $T(n)$, the $2$ bit and the $4$ bit for $T(lfloor n/2rfloor)$, the $4$ bit and the $8$ bit for $T(lfloor n/4rfloor)$, and so on.

Sum them up, and $S_n$ is the number of times the sequence of bits switches between $0$ and $1$. Among $m$-bit numbers, this can be as low as $1$ for $n=2^m-1$ (the first switch, from $0$ in the $2^m$ place to $1$ in the $2^m-1$ place, is always there) or as high as $m$ for $n=lfloor 2^m+1/3rfloor$.

So, there it is - an explicit form for $S_n$, and a sequence $1,2,5,10,21,42,85,dots$ for which $S_n$ goes to $infty$.

share|cite|improve this answer

answered 1 hour ago

jmerryjmerry

14.4k1629

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Awesome! Thank you!!
  $endgroup$
  – Hari Krishna P
  1 hour ago
  

  
  
  
  

add a comment | 

Your Answer

StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

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
);



);

Hari Krishna P is a new contributor. Be nice, and check out our Code of Conduct.

draft saved

draft discarded

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

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3150671%2fdoes-this-sum-go-infinity%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

4

$begingroup$

Let $T(n) = sum_ktext is odd, kle nF(k)$. We can easily see that $T(0)=0$, $T(1)=1$, $T(2)=1$, $T(3)=0$, and $T(n+4)=T(n)$ for all $nge 0$. This is $1$ if the last two bits of $n$ (when expressed in binary) are different, and $0$ if they are the same.

Then, $T(lfloor n/2rfloor) = sum_ktext is odd, kle lfloor n/2rfloorF(k)=sum_ktext is odd, 2kle nF(2k)$, $T(lfloor n/4rfloor) = sum_ktext is odd, 4kle nF(4k)$, and so on. Every integer is equal to $2^m k$ for some nonnegative $m$ and odd $k$. As such, we can take a sum, and get
$$S_n = T(n)+T(lfloor n/2rfloor)+T(lfloor n/4rfloor)+cdots = sum_m=0^lfloor log_2 nrfloorT(lfloor n/2^mrfloor)$$
Each term is $1$ if two particular adjacent bits of $n$ are different and zero if they're equal - the $1$ bit and the $2$ bit for $T(n)$, the $2$ bit and the $4$ bit for $T(lfloor n/2rfloor)$, the $4$ bit and the $8$ bit for $T(lfloor n/4rfloor)$, and so on.

Sum them up, and $S_n$ is the number of times the sequence of bits switches between $0$ and $1$. Among $m$-bit numbers, this can be as low as $1$ for $n=2^m-1$ (the first switch, from $0$ in the $2^m$ place to $1$ in the $2^m-1$ place, is always there) or as high as $m$ for $n=lfloor 2^m+1/3rfloor$.

So, there it is - an explicit form for $S_n$, and a sequence $1,2,5,10,21,42,85,dots$ for which $S_n$ goes to $infty$.

share|cite|improve this answer

answered 1 hour ago

jmerryjmerry

14.4k1629

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Awesome! Thank you!!
  $endgroup$
  – Hari Krishna P
  1 hour ago
  

  
  
  
  

add a comment | 

4

$begingroup$

Let $T(n) = sum_ktext is odd, kle nF(k)$. We can easily see that $T(0)=0$, $T(1)=1$, $T(2)=1$, $T(3)=0$, and $T(n+4)=T(n)$ for all $nge 0$. This is $1$ if the last two bits of $n$ (when expressed in binary) are different, and $0$ if they are the same.

Then, $T(lfloor n/2rfloor) = sum_ktext is odd, kle lfloor n/2rfloorF(k)=sum_ktext is odd, 2kle nF(2k)$, $T(lfloor n/4rfloor) = sum_ktext is odd, 4kle nF(4k)$, and so on. Every integer is equal to $2^m k$ for some nonnegative $m$ and odd $k$. As such, we can take a sum, and get
$$S_n = T(n)+T(lfloor n/2rfloor)+T(lfloor n/4rfloor)+cdots = sum_m=0^lfloor log_2 nrfloorT(lfloor n/2^mrfloor)$$
Each term is $1$ if two particular adjacent bits of $n$ are different and zero if they're equal - the $1$ bit and the $2$ bit for $T(n)$, the $2$ bit and the $4$ bit for $T(lfloor n/2rfloor)$, the $4$ bit and the $8$ bit for $T(lfloor n/4rfloor)$, and so on.

Sum them up, and $S_n$ is the number of times the sequence of bits switches between $0$ and $1$. Among $m$-bit numbers, this can be as low as $1$ for $n=2^m-1$ (the first switch, from $0$ in the $2^m$ place to $1$ in the $2^m-1$ place, is always there) or as high as $m$ for $n=lfloor 2^m+1/3rfloor$.

So, there it is - an explicit form for $S_n$, and a sequence $1,2,5,10,21,42,85,dots$ for which $S_n$ goes to $infty$.

share|cite|improve this answer

answered 1 hour ago

jmerryjmerry

14.4k1629

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Awesome! Thank you!!
  $endgroup$
  – Hari Krishna P
  1 hour ago
  

  
  
  
  

add a comment | 

$begingroup$

Let $T(n) = sum_ktext is odd, kle nF(k)$. We can easily see that $T(0)=0$, $T(1)=1$, $T(2)=1$, $T(3)=0$, and $T(n+4)=T(n)$ for all $nge 0$. This is $1$ if the last two bits of $n$ (when expressed in binary) are different, and $0$ if they are the same.

Then, $T(lfloor n/2rfloor) = sum_ktext is odd, kle lfloor n/2rfloorF(k)=sum_ktext is odd, 2kle nF(2k)$, $T(lfloor n/4rfloor) = sum_ktext is odd, 4kle nF(4k)$, and so on. Every integer is equal to $2^m k$ for some nonnegative $m$ and odd $k$. As such, we can take a sum, and get
$$S_n = T(n)+T(lfloor n/2rfloor)+T(lfloor n/4rfloor)+cdots = sum_m=0^lfloor log_2 nrfloorT(lfloor n/2^mrfloor)$$
Each term is $1$ if two particular adjacent bits of $n$ are different and zero if they're equal - the $1$ bit and the $2$ bit for $T(n)$, the $2$ bit and the $4$ bit for $T(lfloor n/2rfloor)$, the $4$ bit and the $8$ bit for $T(lfloor n/4rfloor)$, and so on.

Sum them up, and $S_n$ is the number of times the sequence of bits switches between $0$ and $1$. Among $m$-bit numbers, this can be as low as $1$ for $n=2^m-1$ (the first switch, from $0$ in the $2^m$ place to $1$ in the $2^m-1$ place, is always there) or as high as $m$ for $n=lfloor 2^m+1/3rfloor$.

So, there it is - an explicit form for $S_n$, and a sequence $1,2,5,10,21,42,85,dots$ for which $S_n$ goes to $infty$.

share|cite|improve this answer

answered 1 hour ago

jmerryjmerry

14.4k1629

$endgroup$

share|cite|improve this answer

answered 1 hour ago

jmerryjmerry

14.4k1629

answered 1 hour ago

jmerryjmerry

14.4k1629

answered 1 hour ago

jmerryjmerry

14.4k1629