Studying: differential geometry, poetic edda.

Doing: lifting myself to hell and back and jump rope.

Building: Making maze generators in minetest (before moving them to minecraft)

And trying to figure out if I can find a function that takes two finite consecutive sequences with length N and M of natural numbers, which start by 1 (E.g [1,2,3], but not [1,2,4,5]) and give back a sequence which contain all the numbers starting from 1 up to the NxM, but not necessarily sorted without using the size of the sequences. So I want to number the cross product of the two sequences.

This crap is related to some programming problem I hit.

   t = {1,2,3...} -- <- can be lenght
   s = {1,2,3,4...} <- can be any length
   xs = {} 

   for i,h in ipairs(t) do 
       for j,k in ipairs(s) do 
           q = f(i,j) -- <- I want to know if f is possible 
  to write
           xs[q] = h * k 
       end 
   end 


 

Well the answer is I think no, but I found some functions that work up to a certain number or that work within certain bounds, so how far we can stretch that? And of course it works for the whole set of natural numbers.