Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

a theorem in graph theory.. please help

Status
Not open for further replies.
E

electroboy

Member level 5
Member level 5
Joined
Dec 30, 2010
Messages
86
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,286
Activity points
1,879
how does the rounded step came in the image below??? please help..

 

The maximum value of

\[\sum_{i=1}^{k} n_i^2\]

is obtained for:

\[n_1 =n-k+1, \quad\quad n_i = 1,\quad i=2..k\].

If you put the numbers you get that value.
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top