Skip to main content

Questions tagged [computational-number-theory]

This tag is for questions regarding to computational number theory, the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number theory.

2 votes
0 answers
117 views

Choose rational numbers $p$, $q$, $r$, and choose a zero $\alpha$ of the cubic polynomial $\alpha^3+p\cdot\alpha^2+q\cdot\alpha+r$. What is an efficient algorithm for deciding, given nonzero rational ...
mezzoctane's user avatar
  • 1,873
1 vote
0 answers
150 views

This is a follow-up question to this question. In that question, we learned that if, $T(y) = \mathrm{Res}_{x}(f(x), y - g(x))$ , then $T(g(z))$ is divisible by $f(z)$. Now, my question is: If $T(y) = ...
Afntu's user avatar
  • 4,295
1 vote
1 answer
94 views

I analyzed primes generated by applying four linear offsets to the first element of twin prime pairs ( 𝑝 , 𝑝 + 2 ), for 𝑝 ≀ 1,000,000: π‘ž1 = 2𝑝 + 1, π‘ž2 = 2𝑝 + 7, π‘ž3 = 2𝑝 βˆ’ 3, π‘ž4 = 2𝑝 + 3. ...
Allen Proxmire's user avatar
1 vote
0 answers
57 views

I am currently reading Henri Cohen's excellent book, A Course in Computational Number Theory (1993). I have a small question regarding Zassenhaus's round 2 algorithm in this book, namely Algorithm 6.1....
Chris's user avatar
  • 86
2 votes
1 answer
207 views

I'm attempting to verify the main computational claim from "Integer partitions detect the primes" by Craig, van Ittersum, and Ono (PNAS 2024, doi: 10.1073/pnas.2409417121). Their Theorem 1.1(...
user avatar
6 votes
2 answers
487 views

Just for curiosity and fun, I was trying to calculate the discriminant of some unusual fields! Let $p=-3\cdot 11\cdot 29\cdot 31 = -29667$ and $q=2\cdot 5\cdot 11\cdot 19\cdot 29\cdot 31 = 1878910$. ...
Tireless and hardworking's user avatar
2 votes
1 answer
88 views

Let $a$ and $x$ be Gaussian integers. How can I calculate the value of $x$ so that $x^2 \equiv a \pmod p$ where $p$ is a regular integer prime and $p \equiv 3 \pmod 4$ ? Example: $a = 2 + 5i$ $p = 7$ ...
sirf's user avatar
  • 23
3 votes
1 answer
212 views

Curve25519 has the well-known equation $E: y^2 = x^3 + 486662x^2 + x$ which is normally considered over the finite field $\mathbb{F}_p$, for $p = 2^{255}-19$. We can lift $E/\mathbb{F}_p$ to $E/\...
Oisin Robinson's user avatar
0 votes
1 answer
132 views

The book Primes of the form $x^2+ny^2$ by Cox discusses in detail the problem of when a prime $p$ can be written as $x^2+ny^2$, and along the way introduces more and more sophisticated number theory ...
new account's user avatar
1 vote
1 answer
90 views

Yesterday I asked Google if 403 is prime. The result showed that it has factors 13 and 31. So I wondered and wrote a little code that finds prime numbers which is also a prime when their digits are ...
merkwur's user avatar
  • 25
1 vote
0 answers
96 views

This is a follow-up question to this question. In that question, we learned that if $T(y) = \mathrm{Res}_{x}(f(x), y - g(x))$ , then $T(g(z))$ is divisible by $f(z)$. More specifically, we can say ...
Afntu's user avatar
  • 4,295
1 vote
1 answer
65 views

How can I check whether two finite sets of $n$ independent vectors in $\Bbb Z^n$ generate the same additive subgroup of $\Bbb Z^n$? For example, $\{(2,7),(5,3)\}$ and $\{(-3,4),(5,3)\}$ have the same ...
Karl's user avatar
  • 13.5k
1 vote
1 answer
83 views

I have a very little knowledge about Sage and this may be a dumb question, but I could not find anything about this. Is there any way to define a sage function of several variables whose arguments are ...
Antagonist's user avatar
2 votes
0 answers
375 views

I am reading an article "Well-poised hypergeometric service for diophantine problems of zeta values" by W. Zudilin. Consider the quantities defined here in pg. $617$ $$\tilde{F_n}:= \frac{1}{...
Max's user avatar
  • 1,059

15 30 50 per page