kpa on Sun, 25 May 2008 05:15:58 +0200
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
factoring polynomials over finite fields
|
- To: pari-users@list.cr.yp.to
- Subject: factoring polynomials over finite fields
- From: kpa <kpatsak@gmail.com>
- Date: Sun, 25 May 2008 06:11:54 +0300
- Delivery-date: Sun, 25 May 2008 05:15:58 +0200
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:received:received:message-id:date:user-agent:mime-version:to:subject:content-type:content-transfer-encoding:from; bh=MusJ1g5iRsMeF9ocC32s2Lk0qJ0yF96SIXcBatWEtc4=; b=pY9n3yiwzF5DCZqf+IamQLuOBBpzMVUXBvDEpiKE201coQWlyGuyqYjn4TKq+UgRvd64DJrzVOIWtL3hBh9B5/zzVQl+R/lpJeg9zrZ6HRXSB88hBgr6GF0S8EGBDliVbButkr22PuorOdNMNCuShbdKHa+OIdP1hMHpvC5l2fM=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:user-agent:mime-version:to:subject:content-type:content-transfer-encoding:from; b=C2jZ1mNsKfgXvHpdsy7mQi15nNYUi7arEzTky451roASDWOE0lFGwmXtM5lRxuh6aToqITrAog5rrXwz5f2S7l9DEcH+DXYE+iUa1bSIU0PM+Vt+idFIc/lSXybqyHbrO8kl60wtFSqolM90I3qm1jz4HFnYac3aMaJ/Rfk6s0w=
- Mailing-list: contact pari-users-help@list.cr.yp.to; run by ezmlm
- User-agent: Thunderbird 2.0.0.14 (Windows/20080421)
Hello,
Sorry for bothering the list again, I'd like to know if there is a
function that can factor a polynomial, over a finite field of order p^k,
where p is prime.
I have found factormod and factorcantor, but in both cases p has to be a
prime and not a power of a prime.
Any ideas will be more than welcome.