#Pnc
1 messages · Page 1 of 1 (latest)
<@&1227988399579730072>
+solved @user1 @user2... to close the thread when your doubt is solved. Mention the users who helped you solve the doubt. This will be added to their stats.
My thought process is making m vertices V1 V2 ...Vm and spaces between them on the n sided polygon be d1 d2 d3 ..dm
Now d1+d2+...dm= n-m
Where d1 can't be zero cuz then sides will be consecutive
Now we just have to find possible solns of the eqn for d1 d2 .. dm as natural nos. For which beggar coin theorem can be used
This is the same as picking m non adjacent vertices from n vertices.
Yess. That also works.
Here no d_i can be zero so as to not make adjacent, which meaningfully is the same thing.
Yeah I've specified that
Yeah then your method works.
Ok so ig 2025 sided polygon mein se hexagon banane ho with no side common so its 2024c5 right ?
a1+a2+a3+...a6=2025-6 Now a1=d1+1 and so on toh d1+d2+...d6=2013 ke solutions meaning 2018C5 aayega shayad
Matlab normal formula mein zero wale solutions bhi hote hain toh a1=d1+1 likh ke woh sirf a>=1 wale solutions nikalega
The n-r+1Cr-1 wala formula
@normal river 2018c5 isn't the complete ans
It's only partially correct
Wanna give a try or should I share soln?
Ah I missed the concavity condition.
Note that for concavity point of concavity of n sided polygon must be chosen.
Yeah precisely.
Division by 5! also.
This is your wala method.
yeah i got confused b/w the two
generalizing it for m sided polygon from n sided polygon with 0 common sides we get
n*(n-m-1cm-1) 1/m right ?
idts we can generalize it for k common sides
You can
Can u tell hyw
How
I did hexagon out of a 2025 side polygon with 4 sides common and damn it was hard to process that shit
Assume that 1,2,3,4 and 5 are already chosen now do the d1+d2+... wala thing and multiply by 2025.
Idhar overcounting ka case nahi hai also ig.
@errant tangle Yo man this clear?
not really
in case of 4 common sides the 4 sides maybe all consecutive , 3 consecutive and 1 separated , 2 consecutive and other 2 consecutive
so i dont think generalising is possible/doable
Ah you're right this absolutely wrong.
Still ig you can generalize the casework.
Will try this later.
if there k common sides then no of possible cases will be ..?
You're absolutely right.
But for 4 this will work.
we can do this by things included in syllabus but mushkil hoga
for k total cases will be
k consectuive sides
x1+x2 = k ke solns ,
x1+x2+x3=k ke solns ,
x1+x2+..... = k ke solns
ka sum
which in itself is hard to process ig
Yeah. It is actually something called partitions iirc.
Isse the thing is you get ordered pairs not unordered ones.
And there is no simple way to avoid repetition.
...Anywhere ig?
+solved @normal river