title: Programming Logic: Finding the smallest equation to a large number
body: <p>I do not know a whole lot about math, so I don't know how to begin to google what I am looking for, so I rely on the intelligence of experts to help me understand what I am after...</p>
  
  <p>I am trying to find the smallest string of equations for a particular large number. For example given the number </p>
  
  <p>"39402006196394479212279040100143613805079739270465446667948293404245721771497210611414266254884915640806627990306816"</p>
  
  <p>The smallest equation is  64^64 (that I know of) . It contains only 5 bytes.</p>
  
  <p>Basically the program would reverse the math, instead of taking an expression and finding an answer, it takes an answer and finds the most simplistic expression. Simplistic is this case means smallest string, not really simple math.</p>
  
  <p>Has this already been created? If so where can I find it? I am looking to take extremely HUGE numbers (10^10000000) and break them down to hopefully expressions that will be like 100 characters in length. Is this even possible? are modern CPUs/GPUs not capable of doing such big calculations?</p>
  
  <hr>
  
  <p>Edit: </p>
  
  <p>Ok. So finding the smallest equation takes WAY too much time, judging on answers. Is there anyway to bruteforce this and get the smallest found thus far?</p>
  
  <p>For example given a number super super large. Sometimes taking the sqaureroot of number will result in an expression smaller than the number itself.</p>
  
  <p>As far as what expressions it would start off it, well it would naturally try expressions that would the expression the smallest. I am sure there is tons of math things I dont know, but one of the ways to make a number a lot smaller is powers.</p>