# Tagged Questions

For questions about finding factors of e.g. integers or polynomials

335 views

### Irreducibility of $~\frac{x^{6k+2}-x+1}{x^2-x+1}~$ over $\mathbb Q[x]$

The Artin—Schreier polynomial $~x^n-x+1~$ is always irreducible over $\mathbb Q[x]$, unless $n=6k+2$, in which case it seems to have only two factors, one of which is always $x^2-x+1$. The ...
181 views

### Have I discovered an analytic function allowing quick factorization?

So I have this apparently smooth, parametrized function: The function has a single parameter $m$ and approaches infinity at every $x$ that divides $m$. It is then defined for real $x$ apart ...
599 views

249 views

### Factoring some integer in the given interval

Let N be a positive integer. Is there an efficient (i.e. probabilistic polynomial time) algorithm which, on input a sufficiently large N, outputs the full factorization of some integer in the interval ...
218 views

### Reducing multivariate rational fractions to lowest terms

I wish to simplify multivariate rational fractions to a canonical form. Thanks to some very helpful mathematically inclined people who verified that my understanding of Wikipedia was correct, I'm now ...
79 views

### Does Pollard rho works for Gaussian integers?

Should I expect that the Pollard rho method ...
315 views

### proof that $\frac{x^p - 1}{x-1} = 1 + x + \dots + x^{p-1}$ is irreducible

I am reading the group theory text of Eugene Dickson. Theorem 33 shows this polynomial is irreducible $$\frac{x^p - 1}{x-1} = 1 + x + \dots + x^{p-1} \in \mathbb{Z}[x]$$ He shows this polynomial ...
184 views

### Fastest Primality test using $N-1$ Factorization?

If $N-1$ could be factored easily with several small prime factors, then what is the fastest way to check $N$ for primality? Updated I'm aware of Pocklington primility test which is not good for ...
49 views

### Finding how large $p$ needs to be to have $n$ unique factors…

If we take a prime $p$, how large does $p$ have to be so that $p-1$ has at least $n$ factors between $f_1$ and $f_2$? (Note that the factors can be prime or composite) Note that I'm looking more for ...
71 views

### Can we continually factorize an expression like $x+y$?

I have a question that, for lack of familiarity or understanding of the relevant fields, I'm not quite sure how to formulate, so I'll just start off with an example and list some questions as I go. As ...
36 views

### What was Gauss' 2nd Factorization Method?

Reading Jean-Luc Chabert's A History of Algorithms, I learned that Gauss, prompted by the poor state-of-the-art, designed two distinct methods for fast integer factorization. Chabert's book discusses ...
75 views

### For any field $k$ and $n>0$: $X^n-a\text{ reducible }\ \Leftrightarrow\ a=b^p\ \vee\ a=-4b^4$.

I'm stuck on the following exercise: Let $k$ a field and $n$ a positive integer. Prove that $X^n-a\in k[X]$ is reducible if and only if there exist a prime $p$ dividing $n$ and a $b\in k$ such ...
153 views

### Probability distribution of the (size of the) smallest prime factor

Related question: Expected smallest prime factor Background: Given a toolbox of factorization algorithms (like trial division, ECM, quadratic sieve, GNFS) and a set of large composite numbers, I'm ...
121 views

### Symmetry in the Sum of Factors

The factors of 72 are 1,2,3,4,6,8,9,12,18,24,36,72. The factors can be organized as such $$m=1,2,3,4,6,8$$ $$n=72,36,24,18,12,9$$ Knowing the symmetric properties and that the 12 factors exist. Pair ...
33 views

### factoring polynomials in ring of integers modulo powerful number

I am having trouble finding info on how to factor polynomials in ring of integers modulo powerful number. For example: $x^2 - 1$ in $\textbf Z_{8}$. I know by tinkering around that $(x - 1)(x + 1)$...
50 views

### Factoring $x^5+B x^4+C x^3+D x^2+E x+F=(x^2+a x+b)(x^3+p x+q)$ over $\mathbb{Q}$

For a quntic polynomial to be reducible to the following form over $\mathbb{Q}$: $$x^5+B x^4+C x^3+D x^2+E x+F=(x^2+a x+b)(x^3+p x+q)$$ We need to match the coefficients ($a=B$ obviously, so we ...
57 views

### Easy method of determining if a polynomial over $\Bbb{Z}$ has any quadratic factors with rational coefficients

There is an easy method of determining whether a monic polynomial $$\sum_0^n a_k x^k$$ with all $a_k \in \Bbb{Z}$ and $a_n = 1$ has any integer roots. At least it is easy if you can factor the ...
43 views

### How Do I Apply the Cantor-Zassenhaus algorithm to $\mathbb{F}_2$?

Recently, I've been trying to implement the Cantor-Zassenhaus algorithm in C++ over $\mathbb{F}_2$. According to this lecture, the algorithm is basically: Input is polynomial $f\in\mathbb{F}_q$ with ...
126 views

### Finding roots and factors of multivariate polynomials

I know that in order to factor a one dimensional polynomial one can find the roots with some method, for instance a numerical newton method. Then one can systematically divide with $(variable-root)$ ...
36 views

### Factorization by multiplying and representation as difference of two squares

Definition 1.$$R: \mathbb N \to \mathbb N: \ R(n) = \lceil\sqrt{n}\rceil^2-n.$$ This is the distance from $n$ to the smallest square greater or equal to $n$. Definition 2. Let $a$ be as positive ...
56 views

### Factoring quaternion into three parts

I am faced with a problem where I have a quaternion which represents rotation and three arbitrary axis about which I can make rotations, thus three unit vectors. What I would like to know is angles (...
285 views

### A quick way to determine number of ring homomorphism

Find the number of ring homomorphism from $\mathbb Z_2\times \mathbb Z_2$ to $\mathbb Z_4$. I know that checking idempotent elements the number of ring homomorphisms is $1$. Again the number of ring ...
34 views

### About factoring trinomials over $\mathbb{Z}$

We were taught in school an algorithm to factor a trinomial of the form $$x^2\pm bx\pm c$$ with $b,c\in \mathbb{Z}^+$. Assuming the best scenario (that the polynomial has both roots in $\mathbb{Z}$),...
66 views

### Multiplication Sieving

Background I made another improvement to Fermat's sieve factorization, by merging the sieves groups of $4,3,5,7,11,13,17$ in two one big group. This method allows me to reduce the values that I need ...