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 |
Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions
5
votes
1
answer
423
views
Is the set of generalized Fermat triples computable?
Is $\;\big\{(a,b,c)\in\mathbb{N}^3: \big(\exists m,n,\ell \in (\mathbb{N}\setminus\{0,1,2\})\big): a^m + b^n= c^\ell\big\}\;$ computable?
8
votes
1
answer
708
views
How "correct" is Knuth's fast addition $(a,b) \mapsto (a \oplus b) \oplus ((a\land b) \ll 1)$?
Donald Knuth suggested a bitwise approximation for addition on the non-negative integers that is very fast on common processors:
$(a,b)\mapsto (a\oplus b) \oplus ((a\land b) \ll 1)$,
where $a,b$ are g …
7
votes
1
answer
827
views
Density of perfect numbers
The question whether the set $P\subseteq \mathbb{N}$ of perfect numbers is infinite, is famously open. I would think that everybody believes the statement below - but has it been proved?
$$\mu(P) := …
5
votes
1
answer
338
views
Golomb subsets of $\mathbb{N}$
A set $A\subseteq\newcommand{\N}{\mathbb{N}}\N$ is said to be Golomb if whenever $a<b \in A$ and $a'<b' \in A$ with $(b-a) = (b' - a')$, then $a=a'$ and $b=b'$. If $A\subseteq \N$ is Golomb, we let $\ …
0
votes
1
answer
147
views
Prime-less intervals $[n,\lfloor q\cdot n\rfloor]$ for $q\in \mathbb{Q}, q>1$
Is there $q\in\mathbb{Q}$ with $q>1$ and the following property?
There are infinitely many $n\in\mathbb{N}$ such that there are no primes in $[n,\lfloor q\cdot n\rfloor]$.
-5
votes
1
answer
281
views
Does the set of Goldbach numbers have positive density?
We say that an integer $n > 1$ is a Goldbach number if $n$ is the sum of two primes. The famous Goldbach conjecture says that every even integer greater than $2$ is Goldbach.
Consider the following mu …
0
votes
1
answer
203
views
Density of "Fibonacci friends"
Let $F$ be the set of all integers $n>1$ such that in the Fibonacci sequence modulo $n$, the value $0$ occurs infinitely often. What is the value of $\lim\sup_{n\to\infty}\frac{|F\cap\{0,\ldots,n\}|}{ …
0
votes
0
answers
107
views
$\log$-classes of irrationals
Let $\mathbb{N}$ denote the set of non-negative integers. For $A\subseteq \mathbb{N}$ we let the (upper) density of $A$ be defined by $d^+(A) = \lim\sup_{n\to\infty} \frac {|A\cap \{0,\ldots, n\}|}{n+ …
0
votes
0
answers
144
views
Remainder-balancedness of primes
Let $\mathbb{N}_+$ denote the set of positive integers. Consider the remainder function $\text{rem}:\mathbb{N}_+\times \mathbb{N}_+ \to \mathbb{N}\cup\{0\}$ defined by $$(n,d) \mapsto n - \Big(\Big\lf …
17
votes
1
answer
1k
views
Does the set of square numbers adhere to Benford's law in every base?
Does the set of squares $S = \{n^2: n\in\omega\}$ adhere to Benford's law for the first digit in every base $b\geq 2$?
Precise formulation of what it means for a set $T\subseteq \omega$ to "adhere to …
4
votes
1
answer
351
views
Does Szemerédi's theorem hold for sets with positive upper Banach density?
We say that a set of natural numbers $A\subseteq \omega$ has positive upper density if $$\lim\sup_{n\to\infty}\frac{|A\cap n|}{n+1} > 0.$$
Szeméredi's theorem states that every $A\subseteq \omega$ hav …
0
votes
1
answer
280
views
Upper density versus upper Banach density on $\omega$
For $A\subseteq\omega$ we define the upper density by $$d_u(A) = \lim\sup_{n\to\infty}\frac{|A\cap n|}{n+1}.$$ For $y\in \omega$ we set $A - y:= \{|a\setminus y|:a\in A\}.$ Note that $|a\setminus y|$ …
3
votes
1
answer
133
views
$3\times 3$ magic squares consisting of entries of a dense set $D\subseteq \mathbb{N}$
Starting point. The struggle for a magic square consisting of distinct square numbers is still ongoing, but it has produced an amusing landmark result called the Parker square. One of the issues is th …
0
votes
1
answer
87
views
Measuring the quality of real approximation
Let $r\in [0,1]\setminus\mathbb{Q}$, let $\mathbb{N}$ denote the set of non-negative integers and let $\mathbb{N}_+=\mathbb{N}\setminus\{0\}$. For $n\in\mathbb{N}_+$ let $$\alpha_r(n)=\min\{\big|r-\f …
2
votes
1
answer
105
views
Hamiltonian path in divisibility graph
Let $\mathbb{N}$ denote the set of positive integers, and consider the graph $(\mathbb{N}, E)$ where a set $\{a,b\}$ of two distinct positive integers belongs to $E$ if there is an integer $k>1$ such …