Yes, and no. Yes the problem can be done with HSG (high speed guessing) easily on a computer using linear programming techniques or equivalent. BUT : the current LLL-PSLQ algorithms do have a long history: The first versions of PSLQ was based on one article of a certain Ferguson ( et al ?) at the time the cost of computation was of the order of n^8 , nowaday, this is far better. Some of the readers of this group are experts in this domain. I recall that the PSLQ integer relation algorithm was based on 1 famous algorithm of linear algebra not trivial at all from a certain Dongarra and a lot of work was made on it to finaly come up with something that can attack simple questions concerning real numbers like : Is the Madelung Constant (the NACL constant) is made of simple numbers, like log(2), log(Pi) , etc. Is gamma , exp(1) and Pi linearly independant ? Is there a simple integer relation between the first non-trivial zeros of the Zeta function ? (I tested that one, does not work apparently). Best regards. Simon plouffe