Maximizing Sum of Finite Sets: Solving Simple Arithmetic Question

  • Thread starter Thread starter sparsh12
  • Start date Start date
  • Tags Tags
    Arithmetic
sparsh12
Messages
12
Reaction score
0
if {x1 , x2 , ...xi} and {y1,y2,...yi} are finite sets.

are two sets of real numbers. Then sum

Ʃ xixj +yiyj must be maximum, and i≠j

so is there some general condition to solve this problem?
 
Physics news on Phys.org
Is there anything in there, variables, summation rules, conditions, indexing, etc, that is allowed to vary? If so, you should tell us, and if not, your question is equivalent to asking for the maximum of the number x.

Perhaps you really don't mean to have that Ʃ there, in which case you get an actual question.
 
I have changed the question,under the title: Travelling Salesman Problem, in number theory page.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top