Skip to main content
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
Search options not deleted user 3206

This tag is used if a reference is needed in a paper or textbook on a specific result.

2 votes

Cyclotomic polynomials: $\Phi_n(p)$ is like $p^{\phi(n)}$ for big enough $p$, right?

I've decided to simplify the argument found in notes of Jameson, and at the same time improve the bounds and ranges of applicability. I'm rewriting for the purpose of understanding and the specific g …
Gerhard Paseman's user avatar
19 votes
3 answers
2k views

Cyclotomic polynomials: $\Phi_n(p)$ is like $p^{\phi(n)}$ for big enough $p$, right?

Apologies in advance if this turns out to be simple. So far I haven't found a proof or a reference. Although I like $p$ to be a prime, I can ask the following for positive integers $n$ and $p$, usin …
Gerhard Paseman's user avatar
0 votes

When is a sequence the sum of two Beatty sequences?

This is the closest I can come to a positive test, but I don't know how well it will work for you. It is essentially taking the intersection of possible solution sets. Let us cut down on symmetry by …
Gerhard Paseman's user avatar
0 votes
Accepted

A question on the bounds of the $n$-th composite $c_n$

I assume $p_n \gt m \gt n$ in the inequality. I have a feeling that this will be as challenging as $\pi(x) + \pi(y) \gt \pi(x+y)$ to solve. The essence to me is that composites are sparsest (primes …
Gerhard Paseman's user avatar
15 votes

Do's and don'ts of writing survey papers

Since you plan to submit it to be part of the conference proceedings, the editor(s) of those proceedings are likely the best people to ask. I would go to them for critical information such as length, …
2 votes

Is there an official name for this prohibited word pattern?

I recommend looking at Balanced Incomplete Block Designs. They have some features which resemble (my interpretation of) your scenario. Each block maps to a word (usually a block is a set, so order o …
Gerhard Paseman's user avatar
2 votes

How many sequences of rational squares are there, all of whose differences are also rational...

Here is an attempt at a cleaner exposition for problem (1');  although I take full credit/blame for the exposition, it is based on ideas posted by Barry Cipra, Gjergji Zaimi, and joro. Let me define …
Gerhard Paseman's user avatar