Binomial parallel resistors.

Algebra Level pending

The desired result is the numeric limit accurate to a tenth of an Ohm of a full row of binomial valued resistors. See the formula below, which contains the parallel resistor formula, for the binomial values are used.

The rows and resistors are zero -indexed, that is, numbering start from 0.

1 j = 0 i 1 ( i j ) \frac{1}{\sum _{j=0}^i \frac{1}{\binom{i}{j}}}

Where i i is the row number and j is the resistor number.

Note well, the answer is an integer which is divided by 10 to approximate the answer. When you can determine that integer, you are done. The calculation of the limit in the calculus sense is not required.


The answer is 5.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Mark Hennings
Feb 9, 2020

We have ( n j ) 1 = j ! ( n j ) ! n ! = Γ ( j + 1 ) Γ ( n + 1 j ) n ! = ( n + 1 ) B ( j + 1 , n + 1 j ) = ( n + 1 ) 0 1 t j ( 1 j ) n j d t \binom{n}{j}^{-1} \; = \; \frac{j!\,(n-j)!}{n!} \; = \; \frac{\Gamma(j+1)\Gamma(n+1-j)}{n!} \; = \; (n+1)B(j+1,n+1-j) \; =\; (n+1)\int_0^1 t^j(1-j)^{n-j}\,dt for 0 j n 0 \le j \le n , and hence j = 0 n ( n j ) 1 = ( n + 1 ) j = 0 n 0 1 t j ( 1 t ) n j d t = ( n + 1 ) 0 1 ( 1 t ) n + 1 t n + 1 1 2 t d t = n + 1 2 n + 1 0 1 ( 1 + u ) n + 1 ( 1 u ) n + 1 u d u \sum_{j=0}^n \binom{n}{j}^{-1} \; = \; (n+1)\sum_{j=0}^n \int_0^1 t^j (1-t)^{n-j}\,dt \; = \; (n+1)\int_0^1 \frac{(1-t)^{n+1} - t^{n+1}}{1 - 2t}\,dt \; = \; \frac{n+1}{2^{n+1}}\int_0^1 \frac{(1+u)^{n+1} - (1-u)^{n+1}}{u}\,du putting u = 1 2 t u = 1 - 2t . Since 1 ( 1 u ) n + 1 u = 1 + ( 1 u ) + ( 1 u ) 2 + + ( 1 u ) n n + 1 \left|\frac{1 - (1-u)^{n+1}}{u}\right| \; = \; \left|1 + (1-u) + (1-u)^2 + \cdots + (1-u)^n\right| \; \le \; n+1 for all 0 u 1 0 \le u \le 1 , we deduce that lim n n + 1 2 n + 1 0 1 1 ( 1 u ) n + 1 u d u = 0 \lim_{n \to \infty}\frac{n+1}{2^{n+1}}\int_0^1 \frac{1-(1-u)^{n+1}}{u}\,du \; = \; 0 Since ( 1 + u ) n + 1 1 u = 1 + ( 1 + u ) + ( 1 + u ) 2 + + ( 1 + u ) n ( n + 1 ) ( 3 2 ) n \left| \frac{(1+u)^{n+1} - 1}{u}\right| \; = \; \left| 1 + (1+u) + (1+u)^2 + \cdots + (1+u)^n\right| \; \le \; (n+1)\big(\tfrac32)^n for all 0 u 1 2 0 \le u \le \tfrac12 , we deduce that lim n n + 1 2 n + 1 0 1 2 ( 1 + u ) n + 1 1 u d u = 0 \lim_{n \to \infty}\frac{n+1}{2^{n+1}}\int_0^{\frac12} \frac{(1+u)^{n+1}-1}{u}\,du \; = \; 0 Thus lim n j = 0 n ( n j ) 1 = lim n n + 1 2 n + 1 1 2 1 ( 1 + u ) n + 1 1 u d u = lim n n + 1 2 n + 1 1 2 1 ( 1 + u ) n + 1 u d u = lim n 2 ( n + 1 ) 0 ln 4 3 e ( n + 2 ) v 2 e v 1 d v \lim_{n \to \infty}\sum_{j=0}^n \binom{n}{j}^{-1} \; = \; \lim_{n \to \infty} \frac{n+1}{2^{n+1}}\int_{\frac12}^1\frac{(1+u)^{n+1} - 1}{u}\,du \; = \; \lim_{n \to \infty} \frac{n+1}{2^{n+1}}\int_{\frac12}^1\frac{(1+u)^{n+1}}{u}\,du \; = \; \lim_{n \to \infty}2(n+1)\int_0^{\ln\frac43}\frac{e^{-(n+2)v}}{2e^{-v}-1}\,dv after the variable change u + 1 = 2 e v u+1 = 2e^{-v} . Watson's Lemma can now be used to deduce that lim n j = 0 n ( n j ) 1 = lim n 2 ( n + 1 ) n + 2 = 2 \lim_{n \to \infty} \sum_{j=0}^n \binom{n}{j}^{-1} \; = \; \lim_{n \to \infty} \frac{2(n+1)}{n+2} \; = \; 2 Thus the limit as n n \to \infty of the effective resistance is 1 2 \tfrac12 , making the answer 5 \boxed{5} .

We know that the value of the given expression is 2 i + 1 ( i + 1 ) ( 2 1 1 + 2 2 2 + 2 3 3 + . . . + 2 i + 1 i + 1 ) \dfrac{2^{i+1}}{(i+1)(\dfrac{2^1}{1}+\dfrac{2^2}{2}+\dfrac{2^3}{3}+...+\dfrac{2^{i+1}}{i+1})} . When i i\rightarrow \infty , the result approaches the limit 1 2 = 5 10 \dfrac{1}{2}=\dfrac{5}{10} . Hence the required answer is 5 \boxed 5 .

Here is a hand-waving explanation. The histogram of a row's binomial values approximates a Gaussian curve. Therefore, it is sufficient to to go far enough to see where that limit is.

When solving problems, it is a good idea to have an idea where the solution is. This is such an approximation.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...