2021-11-22, 22:59 | #1 |
Mar 2016
2^{3}×47 Posts |
searching a factor with a bilinear form
A peaceful and pleasant night,
I am missing a little bit the sunshine, november in Germany is not the best time. If I have a bilinear form mod f such as (a b) (b d) a, b, d elements of N this could be understand as a lattice in the cartesian coordinate system which deliver a function value for the vector (n,m) I am looking for a factor of f and thought a simple solution would be deriving a polynomial for one variable, calculating the polynomial from n=0 up to n=max, multipling these terms mod f together and making then a gcd. Nevertheless there might be better ways to solve this problem. If you know a tricky way to solve faster the problem, give me some lines, please. |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Searching for Wagstaff PRP | T.Rex | Wagstaff PRP Search | 191 | 2021-06-30 17:22 |
pollard rho with bilinear form and eigenvektor ? | bhelmes | Miscellaneous Math | 2 | 2020-03-04 20:52 |
Newbie searching for help | JordanVerlaet | Information & Answers | 5 | 2016-03-12 03:43 |
Lucas-number prime factor form proofs | Raman | Math | 1 | 2012-09-12 13:21 |
What should I be searching for in the output? | jasong | Sierpinski/Riesel Base 5 | 2 | 2006-06-07 20:37 |