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 103242
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
1
vote
0
answers
158
views
Initial conditions to falsify Rowland's conjecture
Based on the Rowland's paper (A natural prime-generating recurrence), is there any theorem to show that for which initial condition $a(1) = k$ the conjecture can be falsified?
For example, for $k$ equ …
- 151
3
votes
When is $2\varphi(n) > n$ – and how to prove it?
A proof for the even part: For the even numbers, you can say $2\phi(n) \leq n$ easily. Because for each even number the format of $\phi(n)$ is $n(1-\frac{1}{2})c = \frac{n}{2}\times c$ which $c \leq …
- 151