- Mail actions: [ respond to this message ] [ mail a new topic ]
- Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ] [ by messages with attachments ]

From: Sergey Dymchenko <kit1980_at_...6...>

Date: Fri, 9 Mar 2012 19:24:32 +0200

Date: Fri, 9 Mar 2012 19:24:32 +0200

Hi, I want to find positive natural numbers A, B, C, D, such that A^4 + B^4 + C^4 = D^4. My program do this: A #> 0, B #> 0, C #> 0, D #> 0, A #=< B, B #=< C, C #=< D, A*A*A*A + B*B*B*B + C*C*C*C #= D*D*D*D, labeling([A, B, C, D]) But I get incorrect result [1, 1, 9742, 9742] with 10 delayed goals. As far as I understand, the system finds that the result is imprecise, but correct enough because 9742^4 is a large number. Probably floating arithmetic is used, not big integers... Is there a way to force precise arithmetic for large integers? Sergey.Received on Fri Mar 09 2012 - 17:24:44 CET

*
This archive was generated by hypermail 2.3.0
: Tue Aug 20 2024 - 18:13:21 CEST
*