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 reference-request
Search options not deleted
user 168142
This tag is used if a reference is needed in a paper or textbook on a specific result.
2
votes
0
answers
74
views
The number of elements with order less than $k$ in a larger cyclic group
I am working on a problem where it has become important to count (or at least bound from above and below) the number of elements of ${\bf Z}/n{\bf Z}$ that have order less than a given $k$, where $2\l …
- 807
2
votes
1
answer
110
views
Counting numerical semigroups by largest element of minimal generating set
For a given integer $n$, I am interested in the number of different numerical semigroups one can make with a generating set consisting only of integers in $[n]$.
I have done some small examples. For $ …
- 807