Let say i have two sets of numbers A and B. and I want to assigne to each number from A two slosest numbers from B. What i would do is to pick an elements from A and then go through the entire B set and find two closest. now if i go the other way arround in orderd to achieve the same result i would take an element from B and compare it to each element in A pick two closest and and assign that element from B to each of selected elements in A. this way i would gat a subset of B assigned to each A element for which i can the alpply the initaill approach. My question now is:(adsbygoogle = window.adsbygoogle || []).push({});

"... i would take an element from B and compare it to each element in A pick two closest and and assign that element from B to each of selected elements in A." is two enough. Obviously not but what is ?? How do i calculate/prove that ??

thnx

b-boy

PS

this is my first post so please help me improve my question if it is not clear enough.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Set mapping problem

Loading...

Similar Threads - mapping problem | Date |
---|---|

B Problem in Counting - Number of Passwords | Feb 23, 2018 |

A "Many-to-One" Mapping of Variables in Logistic Regression | Jan 8, 2017 |

B Statistical comparasion of maps | Dec 20, 2016 |

Is there a map from real numbers to non integers? | Feb 28, 2013 |

Please judge my statistics knowledge based on the following mind map | Nov 1, 2012 |

**Physics Forums - The Fusion of Science and Community**