2
votes
0answers
66 views
Elements of low multiplicative order and computing square roots modulo composites
In "On computing factors of cyclotomic polynomials", Richard P. Brent
gives the identity
$$ 4 \Phi_n(x) = A_n(x)^2 - (-1)^{(n-1)/2} n B_n(x)^2 \qquad (1) $$
where $n$ is odd squa …
0
votes
2answers
106 views
Generating 3SAT circuit for Integer factorization example
I read somewhere that 3SAT can be used to solve Integer Factorization.
If that is true, could someone teach me a simple example of generating the 3SAT by using a small number? Let …
13
votes
11answers
2k views
Fastest way to factor integers < 2^60
I've been running a search for Mordell curves of rank >=8 for about 12 months and have identified approximately 280,000 curves in our archivable range, amongst many millions that a …
0
votes
1answer
196 views
How can an integer be factorized as n*m so that n^m has the highest value. [closed]
Given an integer d, is there a way of finding max(n^m), where d=n*m, except brute-forcing it ?
n and m don't have to be primes.
For example:
The number 12 can be factorized into …
0
votes
1answer
260 views
Can infinite polynomials be expressed as a product of its linear factors?
Background:
In the 1700s, Euler solved the Basel Problem, which was to solve $\sum_{n=1}^\infty\frac{1}{n^2}$ in closed-form. Euler showed that it was equal to $\frac{\pi^2}{6}$ b …
2
votes
2answers
225 views
Factorization of antisymmetric bounded holomorphic functions
A basic principle in complex function theory is that one can split off zeros of holomorphic functions in a similar way as for polynomials: If $f$ is holomorphic near $0$ and $f(0) …
0
votes
0answers
92 views
Method to square polynomials by making a change of variable
I am working with elliptic curves defined over $\mathbb{Q}(t)$, my current task is to search is to search torsion-free points in these curves after possibly changing $t$ by a ratio …
10
votes
2answers
527 views
Saying things rapidly about integer factorisations
Let $N$ be a positive integer. Thanks to the Miller-Rabin test and the work of Agrawal, Kayal and Saxena, these days people have much much faster algorithms for testing whether $N$ …
1
vote
3answers
343 views
Greatest Prime Factors: For any prime p, is there an integer C such that for any x >= C, all but 1 integer in the sequence x+1, x+2, …, x+p has a greatest prime factor > p.
I apologize if this is a naive question about greatest prime factors (gpf). I was thinking about the sequence of integers where $gpf(x) \le p$ where $p$ is any prime.
Clearly, as …
2
votes
3answers
622 views
Algorithm for detecting prime powers
While reading Peter Shor's paper Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, I came across the following quote:
"This sche …
2
votes
3answers
457 views
Groups of Rational Points on Gaussian Circles
Let a gaussian circle $C_R$ be any circle defined by the equation:
$$x^2+y^2 = R, (x,y) \in \mathbb{R}^2$$, where $R$ is the norm of a gaussian integer ($R=a^2+b^2, (a,b) \in \mat …
11
votes
3answers
587 views
What is known about the polynomial factorization of power series?
Some power series factorize; $1+\sum_{n=1}^\infty x^n=\prod_{n=1}^\infty (1+x^{2^n})$ and $1+\sum_{n=1}^\infty x^{2n}/(2n+1)!=\prod_{x=1}^\infty (1+x^2/n^2\pi^2)$ for example; whi …
5
votes
0answers
301 views
Optimal Gear Trains
Suppose you need to slow down a turning motor so that a gear turns at
an angular velocity $\frac{a}{b}$ of that of the motor shaft, where $a$ and
$b$ are natural numbers. For exam …
0
votes
0answers
113 views
Two-Factor Factor Analysis Model
Hi everyone,
I want to build the following factor analysis model and I've samples observations of data (i.e., $m(s)$), labeled with factor $s$. The observations are affected by bo …
7
votes
5answers
921 views
Polynomials all of whose roots are rational
I have two questions about the class of integer-coefficient polynomials all of whose roots are rational.
I asked this at MSE, but it attracted little interest (perhaps because it i …

