|
Georgi Guninski on Sun, 06 Dec 2020 17:02:32 +0100
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|
Can bnfinit recognize square integer factors without factorization?
|
- To: pari-dev@pari.math.u-bordeaux.fr
- Subject: Can bnfinit recognize square integer factors without factorization?
- From: Georgi Guninski <gguninski@gmail.com>
- Date: Sun, 6 Dec 2020 18:02:18 +0200
- Delivery-date: Sun, 06 Dec 2020 17:02:32 +0100
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025; h=mime-version:from:date:message-id:subject:to; bh=vUXdVvNECyrdGGEM8yQTnUkVvlQxgC0md8VfLlhHed0=; b=M8I0PVQfZyhb+YR06Dyaa2tlKyq+gDlyGe8CIYrSnHKX1vpudAPzowP7a+6DNQtHuK 0SjJqwnje2JfVzX96FsjyaDhFUbKAAR+mXXzE2Tl/GYfDU+4jbJgC8lt2jESxQE07HkX Pgj1c7ZflEaUsDlgcnOoL3RRyosaoKafyXL3H/X8G/Sok2XpT82hkhW/5Q/QBQnnaVw8 21BliqDyez9chweERnqpbUP0NloNt+bUuy5UptrB9ME68ox9KpAa35Ttw5d9lXqBfQM4 yUT4dlwN8tLQI+uHHcz1p8zvNqoMwuc7crtD5F0/Y0VuQBC6b6syCGf9d7Fcdk5x1XU0 JCqA==
Version 2.11.1
after several allocatemem()s:
? setrand(1);L=2^30;p=randomprime(L);q=randomprime(L);
n=p^2*q;addprimes(n);K=bnfinit(x^2+n);
Takes very long, didn't wait it to finish.
Can this be used as algorithm to recognize square integer factors?
bonus points if bnfcertify() passes :)
CC'me, don't read the list often.