## Unsolvable with qb64?by lawgin (no login)The equation x^2-61*y^2 = 1 supposedly has an infinite number of integer solutions for x and y. The problem is to find the solution with the lowest value of x. I have tried using _INTEGER64 and _UNSIGNED _INTEGER64 variables, but to no avail. Even this minimal solution appears to be too big to handle with qb64. Anyone have an idea how to do it? Posted on Mar 14, 2012, 12:39 PMRespond to this message Return to Index |

Response Title | Author and Date |

Re: Unsolvable with qb64? | Mercury on Mar 15 |

Re: Unsolvable with qb64? | lawgin on Mar 15 |

Yes Pell's equations | David on Mar 15 |

It looks like you're doing Algebraic Number Theory, would you like some help? | Clippy on Mar 16 |

*Nice solution--where did you find it? | lawgin on Mar 16 |

Haha XD | Zack on Mar 17 |

Copyright © 1999-2016 Network54. All rights reserved. Terms of Use Privacy Statement |