Reputation
2,091
Top tag
Next privilege 2,500 Rep.
Create tag synonyms
Badges
11 16
Newest
 Yearling
Impact
~21k people reached

Sep
5
revised Number of pairs $(i, j)$ where $1\leq i < j \leq N$ such that $i|j$
Improved the image and hopefully the explanation
Sep
5
answered Number of pairs $(i, j)$ where $1\leq i < j \leq N$ such that $i|j$
Jul
22
answered Sizes of Blocks of Consecutive Integers Divisible by at Least One Prime Less than or Equal to $r$.
Jun
1
answered Infinitely many primes congruent to 1 mod prime
May
12
comment Euler's Refutation of Fermat's Conjecture
Fermat statement was about the integers $2^{2^n}+1$.
May
5
answered Finding the Norm of an element in a field extension
Apr
23
answered Showing that $|f^{(n)}| \le n!n^n$ and then making this result sharper
Apr
6
revised Comparing sums of surds without any aids
added 53 characters in body
Apr
5
answered Comparing sums of surds without any aids
Mar
31
revised Algorithm to find representation of an element of field extension $\mathbb{Q}(q)$ in the form $\sum a_i q^i$
added 125 characters in body
Mar
31
answered Algorithm to find representation of an element of field extension $\mathbb{Q}(q)$ in the form $\sum a_i q^i$
Mar
31
comment quadratic residues and prime divisor
As far as I know, we don't know if there are infinitely many integers $n$ such that $n^2+1$ prime, it is an open problem.
Mar
17
comment Properties of a certain integer sequence
Carrying the computation a little further gives the sequence: 1, 1, 2, 2, 3, 5, 6, 8, 11, 17, 25, 33, 41, 52, 80, 139, 204, 245, 289, 410, 692, 1159, 1477, 2010, 2769, 4247, 6128, 7709, 9817
Mar
16
revised Partial fraction decomposition of p'/p
Removed the c
Mar
16
answered Partial fraction decomposition of p'/p
Mar
15
comment Reducing simultaneously a pair of fractions $\frac{a^2}{b},\frac{ a^3}{c}$ using only gcds
You are right, there is no known algorithm even to know if an integer is square-free which does not rely in factorization. Thanks, I hadn't think in your example.
Mar
15
answered Reciprocity problem in I&R “A Classical Introduction in Modern Number Theory”
Mar
14
revised Reducing simultaneously a pair of fractions $\frac{a^2}{b},\frac{ a^3}{c}$ using only gcds
EDIT: Changed to make more clear the question.
Mar
14
comment Reducing simultaneously a pair of fractions $\frac{a^2}{b},\frac{ a^3}{c}$ using only gcds
You would need either to factor $g$ in order to find $d$ or to iterate over the integers up to $\sqrt[6]g$. However I'm changing the question to allow root extraction and avoid iteration. What I'm looking for is a fast way to compute it.
Mar
14
revised Reducing simultaneously a pair of fractions $\frac{a^2}{b},\frac{ a^3}{c}$ using only gcds
Sorry the method I give is not correct