| 2014-06-29 20:40:40 +0200 | received badge | ● Notable Question (source) |
| 2014-06-29 20:40:40 +0200 | received badge | ● Popular Question (source) |
| 2012-03-29 14:25:51 +0200 | commented question | Backing into a problem damn that enter key! While 1025=1025 is expressed in less characters that 2^10+1 this will not be so for the really large numbers I'm talking about. I need to represent these large numbers in the least amount of characters possible. |
| 2012-03-29 14:22:52 +0200 | commented question | Backing into a problem I'm defining efficiency as most concise human readable equation. Not the simplest form mathmatically. |
| 2012-03-26 16:35:46 +0200 | commented question | Backing into a problem Ok, bare with me as math is by far my worst skill. |
| 2012-03-23 16:38:26 +0200 | commented question | Backing into a problem I will need to produce an equation for a super large integer (1000+), so n=n is not so efficient. |
| 2012-03-22 16:14:35 +0200 | commented question | Backing into a problem On the right side only integer math(powers, addition, subtraction). Efficiency is the fewest number of characters(operations) in the equation. 2^2+2^2+2^2+2^2 is not as efficient as 4^2 |
| 2012-03-22 15:40:21 +0200 | received badge | ● Editor (source) |
| 2012-03-22 15:36:04 +0200 | asked a question | Backing into a problem Is it possible to back your way into a problem? Task: I want to supply an integer and then produce an equation for that. 694 = 26^2 + 4^2 + 2 I would like to reduce the equation size to the most efficient possible. |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.