Expand Cut Tags

No cut tags

Feb. 9th, 2005

ilai: (Default)
I had trouble sleeping last night, because my mind drifted off to a problem, which I record below. I make no guarantees with respect to coherence :)

Say that you have a set of tuples (puv), where p is a point on the x-y plane, u and v are positive integers, and u > v. One of the tuples is the origin tuple, (p0u0v0), and no two tuples share the same point.

A run is a nonrepeating sequence of n such tuples (pi, ui, vi), starting with the origin tuple, where any sum u0 + v1 + v2 ... + vi is at least ui+1.

Let's say the length of the run is the sum of all the distances between adjacent pi and pi+1 points in the sequence, and the size of the run is the sum u0 + v1 + v2 ... + vn.

the actual problem, maybe )

Then my head went "BA-NA-NA" and I decided I should forget about this and go to bed. Maybe I'm mad.

Profile

ilai: (Default)
Ian

July 2014

S M T W T F S
  12345
6789101112
13 141516171819
20212223242526
2728293031  

Most Popular Tags

Style Credit

Page generated May. 22nd, 2025 07:09 am
Powered by Dreamwidth Studios