Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with nt.number-theory
Search options not deleted
user 27513
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
3
votes
A family of difference sets (paper by A. L. Whiteman)
The multiplicative group of $\mathbb{Z}_{pq} \cong \mathbb{Z}_{p} \times \mathbb{Z}_{q}$ is not cyclic, but is generated by $x =(a,1)$ and $y = (1,b)$ where $a$ is a primitive root mod $p$ and $b$ is …
- 1,300
2
votes
Permutations of $(Z/pZ)^*$
A similar concept is an orthomorphism of a group $G$. This is an automorphism $\theta: G \rightarrow G$ with the property that $g^{-1}\theta(g)$ is a bijection (equivalently an automorphism). Two orth …
- 1,300
8
votes
Are these two methods for constructing Hadamard matrices known?
Two matrices are Hadamard equivalent if they differ from one another by permuting and negating rows and columns. It is known that there is a unique Hadamard equivalence class of Hadamard matrices at o …
- 1,300