Recent content by NanoTec

“k” is the number of printings. “n” is a constant the total number of squares. For a given value of “n” you want to know for what value of “m” is ”k” lowest. “k” is a function of “m” so if one were to have a graph of that one would look for the lowest point on that graph, or its minimum. The...

-I’m unfamiliar with the language or logic scheme you are using, but -Here is the simplest algorithm for determining the path Create an array: a grid a-f x A-F Fill is array with a number > 6*6 = 36 ( assume least optimal ) Place a zero at the robots position. Look at every cell in this...

~~ spoiler ahead ~~ R=13= 2^8-3^5 = 2^4-3^1 (Which I wish Sengupta had posted as an example too…) For 2^P-3^Q > 0 there exist: (I.) for a value of P a maximum value of Q, and/or for a value of Q a minimum value of P. [as already stated by Werg22] P>Q/log3(2) For a value of R with multiple...

I haven’t seen a stance which starts from a low level perspective. The main corporate problems revolve around code maintenance and debugging leaving very little impetus for a language change. The compiler allows abstraction of the computers hardware: instruction sets, cache alignment...