#Anyone knows the approach to this

95 messages · Page 1 of 1 (latest)

misty field
sweet stoneBOT
#
  1. Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
  2. Wait patiently for a helper to come along.
  3. Once someone helps you, say thank you and close the thread with:
    +close
    
  4. Feel free to nominate the person for helper of the week in #helper-nominations
  5. Do not ping the mods, unless someone is breaking the rules.
  6. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
misty field
#

combinatorics

#

but that will make it undefined

#

for ncr to be defined, n has to be greater than or equal to r

#

and n cant be 0

#

it has to be any natural number

#

such that it would satisfy the sequence

rose viper
# misty field

To start with, you remember the actual expression for nCk?

rose viper
#

So obviously, n >= 66, right?

#

Or rather, if n < 66, it's just 0.

#

Or wait.

#

No.

misty field
#

i get that

#

but

rose viper
#

But what?

final cobalt
#

i like it

misty field
#

uh

#

thanks

misty field
#

suppose you have to find the nth term

#

and n has to be any natural number

#

which year or grade?

#

oho

#

final year

#

XD

rose viper
#

Because for any finite n, at some point all terms go to 0.

misty field
#

idk how to explain like you have to make a formula such that the thing will be defined

#

so something the would always make it defined

rose viper
#

It is always defined.

misty field
rose viper
misty field
#

i tried....

#

i got

#

wait

#

but it wouldnt make sense

#

like if you put 2

#

you would get 2c66

#

which is wrong

#

wait

#

what if i equate and make two equations with n and k?

#

with the conditions so that it satisfies

rustic spruce
#

Hm... Well, I guess we can use series multisection.

analog ferry
#

Maybe use the 66ᵗʰ root of 1 and binomial expansion.

misty field
misty field
misty field
analog ferry
#

In ℂ

rose viper
analog ferry
#

Maybe instead of 66 you could try the cases 2 and 3 to see what happens.

misty field
#

bruh dude i actually just wrote that by the patern

#

but then i realized

#

that if n was any natural number it woudnt make sense like plug 2

#

2c66

#

thats just not defined

fossil cedar
#

Further hint: Consider ||(1+x)^n||

analog ferry
#

I looked up at what a series multisection is and it is the same as what I had in mind.

misty field
#

i think i got the answer

#

thank you so much y'all

#

(1/66)\sum_{k=0}^{65}(1+e^2πi/66)^{n}

#

uh

#

can this be simplified further down?

#

or is it just fine here

fossil cedar
#

this exponent is wrong

#

ig you could consider this as summing the nth powers of the roots of (insert another poly I'll let you find)

#

then get a recursion with newton's

#

but that's not exactly simplifying

misty field
#

oh

#

ill see tomorrow after school

#

gotta wake in 4 hours 😔 and do a bit of differentiation and computers

analog ferry
#

Use (1-z)(1+z+z²+...+zⁿ)=1-zⁿ⁺¹ to find formulas on the series multisection.

misty field
#

Aight

#

I actually got it into polar form

#

Cos@ + i*sin@

#

Like tried out something

misty field
fresh tideBOT
#

mimshell

#

mimshell

analog ferry
#

Sorry I cannot delete the penultimate message, I meant
$$\sum_{k=0}^{65}(1+\omega^k)^n=\sum_{k=0}^{65}\sum_{p=0}^n\binom{n}{p}\omega^{pk}
=\sum_{p=0}^n\binom{n}{p}\sum_{k=0}^{65}\omega^{pk}$$

fresh tideBOT
#

mimshell

analog ferry
#

Indeed it delivers your formula.

fresh tideBOT
#

mimshell

misty field
#

yeah cool thanks y'all

#

+close