Fun for me & Challange for you

Let's define an recurrence relation , an+1=(n+2n)annN{ a }_{ n+1 }=\left( \cfrac { n+2 }{ n } \right) { a }_{ n }\quad \forall n\in N . Such that a1=2{ a }_{ 1 }=2 .

Then Find closed form of, fk(n)=n=1nn=1n..........n=1n(an)ktimes\displaystyle{f^{ k }\left( n \right) =\underbrace { \sum _{ n=1 }^{ n }{ } \sum _{ n=1 }^{ n }{ } ..........\sum _{ n=1 }^{ n }{ \left( { a }_{ n } \right) } }_{ k\quad times } }

Nishu

#Calculus #Challenge #Original #Fun-with-Maths

Note by Nishu Sharma
6 years, 1 month ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Firstly this is not at all a competitive site, it's a site for learning(don't feel bad I am just correcting you).Take this light heartedly, I am not being harsh at all.

Also be very careful in writing multiple summations, observe that you are using n everywhere, that doesn't properly the meaning of the problem please change the variable of the limits.

Ronak Agarwal - 6 years, 1 month ago

Log in to reply

sorrry I'am totally new to this site , and don't know much about it .. okay thanks for clerifying .

And I'am totally new to latex , But still I think there is no need to change variables , It's well understood from my side . Since after solving first summition we got answer in terms of n , and then we restart with n=1 ,2,3 , and again finally get in terms of n . So I don't think it is incorrect... @Ronak Agarwal

Nishu sharma - 6 years, 1 month ago

@Raghav Vaidyanathan @Kartik Sharma @Ronak Agarwal etc etc.... It is challange for you guys ! I have recently Joined brilliant and I found Ronak and Raghav as tough competitor .. So it is for you ! Hope you enjoy ... :)

Nishu sharma - 6 years, 1 month ago

@Nishu sharma

The answer is:

2×(n+k+1k+2)\Large 2\times \left( \begin{matrix} n+k+1 \\ k+2 \end{matrix} \right)

where:

(nr)\left( \begin{matrix} n \\ r \end{matrix} \right) is n choose r

Raghav Vaidyanathan - 6 years, 1 month ago

Log in to reply

Sorry but why question is incorrect ? I don't think that question is incorrect , may be possible that it is difficult to understand what I try to post , Since I'am new to latex and this is not bookish problem language , It is original question by me. Also Instead i think your answer is incorrect . The closed form I getting is ..

2(n+kk+1)\displaystyle{2\left( \begin{matrix} n+k \\ k+1 \end{matrix} \right) }

May be possible that my answer is wrong , Since It is hypothetical question by me , But still i think you should check your's once again ?

Nishu sharma - 6 years, 1 month ago

Log in to reply

Sorry, I made a mistake last time. You are right, the limits of summation are correct. But the meaning of kk is not well defined. What if k=0k=0? According to me, when k=0k=0, no summation is done, and hence the nthn^{th} term should be a(n)a(n).

Raghav Vaidyanathan - 6 years, 1 month ago
×

Problem Loading...

Note Loading...

Set Loading...