Trjtdtk

How to test the sharpness of a knife?

Animal R'aim of the midrash

Have the tides ever turned twice on any open problem?

Asserting that Atheism and Theism are both faith based positions

Should I be concerned about student access to a test bank?

Are stably rational surfaces all rational?

Weird lines in Microsoft Word

Why is "la Gestapo" feminine?

PTIJ: If Haman would have fallen with no one around to hear him fall, would that still have made a sound?

If I cast the Enlarge/Reduce spell on an arrow, what weapon could it count as?

Magento 2: Make category field required in product form in backend

Which partition to make active?

What do the positive and negative (+/-) transmit and receive pins mean on Ethernet cables?

How are passwords stolen from companies if they only store hashes?

SQL PRINT vs SQL EXEC

Is this Pascal's Matrix?

How to balance a monster modification (zombie)?

Why doesn't the fusion process of the sun speed up?

Turning a hard to access nut?

Why does Surtur say that Thor is Asgard's doom?

The English Debate

PTIJ: Where did Achashverosh's years wander off to?

Adding axes to figures

Do native speakers use "ultima" and "proxima" frequently in spoken English?

Does this sum go infinity? [on hold]

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?

7

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 days ago

Hari Krishna P

asked 2 days ago

Hari Krishna PHari Krishna P

385

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$

put on hold as off-topic by RRL, Thomas Shelby, Cesareo, José Carlos Santos, Parcly Taxel yesterday

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

• "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – RRL, Thomas Shelby, Cesareo, José Carlos Santos, Parcly Taxel

If this question can be reworded to fit the rules in the help center, please edit the question.

• 
  
  
  

  
  1
  

  
  
  
  
  
  

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

  
  
  
  

add a comment | 

7

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 days ago

Hari Krishna P

asked 2 days ago

Hari Krishna PHari Krishna P

385

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$

put on hold as off-topic by RRL, Thomas Shelby, Cesareo, José Carlos Santos, Parcly Taxel yesterday

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

• "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – RRL, Thomas Shelby, Cesareo, José Carlos Santos, Parcly Taxel

If this question can be reworded to fit the rules in the help center, please edit the question.

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  @Max thanks for the edit....this was my first question on mathstackexchange!
  $endgroup$
  – Hari Krishna P
  2 days 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 days ago

Hari Krishna P

asked 2 days ago

Hari Krishna PHari Krishna P

385

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 days ago

Hari Krishna P

asked 2 days ago

Hari Krishna PHari Krishna P

385

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 days ago

Hari Krishna P

asked 2 days ago

Hari Krishna PHari Krishna P

385

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 days ago

Hari Krishna PHari Krishna P

385

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 days ago

Hari Krishna PHari Krishna P

385

1 Answer
1

active

oldest

votes

6

$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 2 days ago

jmerryjmerry

14.8k1632

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Awesome! Thank you!!
  $endgroup$
  – Hari Krishna P
  2 days ago
  

  
  
  
  

add a comment | 

6

$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 2 days ago

jmerryjmerry

14.8k1632

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Awesome! Thank you!!
  $endgroup$
  – Hari Krishna P
  2 days ago
  

  
  
  
  

add a comment | 

6

$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 2 days ago

jmerryjmerry

14.8k1632

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Awesome! Thank you!!
  $endgroup$
  – Hari Krishna P
  2 days 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 2 days ago

jmerryjmerry

14.8k1632

$endgroup$

share|cite|improve this answer

answered 2 days ago

jmerryjmerry

14.8k1632

answered 2 days ago

jmerryjmerry

14.8k1632

answered 2 days ago

jmerryjmerry

14.8k1632