# Questions tagged [number-theory]

Questions on the number-theoretic functionality of Mathematica.

319 questions
Filter by
Sorted by
Tagged with
28 views

### Dirichlet L-function associated to Kronecker symbol

The Fourier coefficients of the genus 2 Eisenstein series on the Siegel upper half-space are given by sums over Cohen functions. The Cohen function contains as a multiplicative factor a Dirichlet L-...
31 views

### Where To Start; Numbered Triangle

I am working on a square matrix. Cell (1,1) starts at 1, and each following 2, then 3, .., working x to y order. Plus, each cell is computed after this, to Sum of Squares minus Sum of each cell. Sorry,...
56 views

### PowerModList anomaly

This post is related to Not comprehending PowerMod. Here the issue is that PowerModList, in v. 12.1 finds no cube roots of 1 Mod 10^60 - 1: ...
58 views

### Euler Numbers A000295 And Basic MMA Code

When I run this snippet in MMA ...
38 views

142 views

### Among the first 10,000 multiples of 17

Hello I'm new with Mathematica and I can't find a way where I can do this condition. Among the first 10,000 multiples of 17 how many have the sum of their digit multiple of 17? The part for the ...
52 views

### Condition for an integer exactly three primes factors? [closed]

I would like to count the number of integers n in the range [1, 10000] that satisfy all three of the properties below: n has ...
78 views

### Help: Obtain a huge amount of data solved in FrobeniusSolve? (perhaps better without running FrobeniusSolve?) [closed]

How to obtain a huge amount of data solved in FrobeniusSolve more systematically? I am interested in obtaining these two sets of data from FrobeniusSolve: ...
69 views

### Problem with Solve and PrimeZetaP

I assume this is something to do with limits on numerical precision, but can someone explain the difference in output between these two Solve problems: ...
55 views

### how to find smallest number satisfies having given number of solutions

I want to find the smallest number $t$ which satisfies $t=a^2+b^2$ ,where there are 12 pairs of $a$ and $b$ solution. my first code is very slow ...