Questions on more advanced topics of number theory. Consider first if (elementary-number-theory) might be a more appropriate tag before adding this tag.

learn more… | top users | synonyms (1)

3
votes
0answers
82 views

Do the solutions to the unit equation lie dense in the complex numbers

Let $S\subset \overline{\mathbf{Q}}$ be the set of solutions to the unit equation, i.e., $S$ consists of algebraic integers $a$ such that $a$ and $1-a$ are units in the ring of algebraic integers. ...
3
votes
0answers
350 views

Ramanujan Series

I have the following question involving the series of $1/\pi^3$: Can we find such expansions by using the one for $1/\pi^3$ with $1/\pi^4$ or $1/\pi^n$ etc? Note that $$\frac{1}{32}\sum_{n=0}^\infty ...
3
votes
0answers
60 views

Green’s formula in p-adic integration

Is there an analogue of Green's formula in p-adic integration (with respect to the Haar measure)?
3
votes
0answers
59 views

Properties preserved under the “reversal” of a recurrence equation

Consider the recurrence equation $u_n = f(u_{n-1},\ldots, u_{n-k})\;,$ defined for $n=0,1,2\ldots$. If this is a linear recurrence and the coefficient function on $u_{n-k}$ is nonzero in ...
3
votes
0answers
192 views

Approximation of a real number as a linear combination of two reals with coprime integral coefficients

Given two nonzero real numbers $x$ and $y$ such that $y/x$ is irrational, a real number $z$ to be approximated, and a tolerance $\epsilon$, give me an algorithm that will provide coprime integers $a$ ...
3
votes
0answers
176 views

Hauptmoduls for modular curves

If I have a modular curve, how does one in general find a Hauptmodul for this curve?
3
votes
0answers
295 views

Rational independence

The specific question is the following: I am given a set of $[L/2]$ numbers $$g(n) = \sqrt{ c(n)^2 + \alpha c(n) + \beta},$$ where $c(n) = \cos(2\pi n/L)$ (so both $c(n)$ and $g(n)$ depend on $L$ ...
3
votes
0answers
196 views

The discrete Fourier transform of a Dirichlet charachter

I usually work in number theory so I am not familiar with Fourier transforms, I have read up on them and know the basics but it never seems to be in number theory language. I am trying to find the ...
3
votes
0answers
139 views

How to show that if K contains a complex root of unity, then every nonzero element of K has positive norm?

I am trying to prove the following assertion: If an algebraic number field $K$ contains a complex root of unity, then the norm of every nonzero element of $K$ is positive. I think this is supposed ...
3
votes
0answers
250 views

Counting Solutions of Diophantine Inequalities

I understand that Diophantine Analysis is an enormous field! Without first determining the solution set, suppose I'd like to calculate the number of non-negative integer solutions $(x,y,z)$ of ...
2
votes
0answers
34 views

Find maximum height of smallest flower

Little beaver planted n flowers in a row on his windowsill and started waiting for them to grow. However, after some time the beaver noticed that the flowers stopped growing.So he decided to come up ...
2
votes
0answers
15 views

Non-UFD that there exists set $X$ of any cardinality and $a$ that $xy$ is not divisible by $a^2$ for any $x,y \in X$ and $x^2$ is divisble by $a^2$

Let's say we want to construct a non-UFD that is a commutative ring that satisfies: There exists $a$ such that there exists a set $X$ of elements of finite cardinality $k$ such that for any $x,y \in ...
2
votes
0answers
53 views

$\sum_{k=1}^n \lfloor kx \rfloor =$ ?

Let $x$ be a positive real number and $n$ a positive integer , then how may we evaluate $\sum_{k=1}^n \lfloor kx \rfloor $ ? If a closed form doesn't exist then can we at least find an asymptotic ...
2
votes
0answers
142 views

$e=1$ in Theorem 30 from Marcus book “number fields”

Theorem 30 in Marcus book states that, if $p\in\mathbb Z$ is an odd prime and $q$ is a prime $\neq p$, then, fixing $d$ as a divisor of $p-1$ we have that $q$ is a $d$-th power $\operatorname{mod}q$ ...
2
votes
0answers
28 views

floor function inequality $\frac{3c-3n-3}{2n+3} \geq \lfloor\frac{3c-3n}{2n+3}\rfloor$

I want to prove following statement: $$\forall K\in \mathbb R \exists c\in \mathbb N c\geq K s.t.\forall n\in \left\{1,2,...,c-1\right\}: \frac{3c-3n-3}{2n+3} \geq \lfloor\frac{3c-3n}{2n+3}\rfloor$$ ...
2
votes
0answers
71 views

Diophantine inequality that comes up after Vieta Jumping Hurwitz technique

I am blaming this on Prove the equality EDITTTTT: allowing $x_1 \geq x_2$ and $x_2 \geq x_n,$ I would rather not explain what that was about and the only changes are in $n=3,4,$ already settled. ...
2
votes
0answers
40 views

Cramér's Model - “The Prime Numbers and Their Distribution” - Part 2

Following a previous question (here you'll find an introduction): The book states that using the convergence of the binomial distribution towards the Poisson distribution, it's easy to show that ...
2
votes
0answers
39 views

What's the proof for the #integers less than $n$ that can be expressed as the sum of two squares is $\frac n{\sqrt{\log n}}$?

This result is used in the Erdos' Distance problem, in the Landau-Ramanujan constant, but I can't find a proof anywhere. http://en.wikipedia.org/wiki/Erd%C5%91s_distinct_distances_problem ...
2
votes
0answers
38 views

Bernoulli Conjecture on $B_{2^n}$

So in a recent question I was trying to prove that $2^n-1$ will never be a Carmichael number (Can a Mersenne number ever be a Carmichael number?), I was going to prove it true as long as a certain ...
2
votes
0answers
30 views

Fermat pseudo primes

Is it possible for a number of the form $2^p-1$ with $p\in \mathbb{P}$ (the primes) to satisfy $3^{2^p-2}\equiv 1\pmod {2^p-1}$ and not be a prime? In other words, can a Mersenne number be a Fermat ...
2
votes
0answers
92 views

“Remainder” operation in mod 2^32

I debated posting this here, in the cryptography SE, or the programming SE. Obviously, I chose here, but I'm not confident in my choice... I'm attempting to "undo" a function, but I've hit a slight ...
2
votes
0answers
29 views

Polynomial Density Theorem

So I was consider Lagrange's 4-square theorem and came up with this generalization: Given a polynomial with rational coefficients $$P(x) = a_0 + a_1x + ... + a_nx^n$$ Determine if there exists ...
2
votes
0answers
144 views

Successive ratios of a sequence, is this limit true?

The natural numbers $1,2,3,4,5....$ can be calculated as the row sums of the triangle $T(n,k)$ equal to $1$ if $n \geq k$ and $0$ otherwise: $$\displaystyle T = \left(\begin{matrix} ...
2
votes
0answers
52 views

Integer Solutions To Linear Equation

$$a*q_1+b*q_2=c$$ $$a*q_3+b*q_4=f$$ $q_1, q_2, q_3, q_4$ rational numbers, $c,f$ integer Given $q_1, q_2$ can you construct all solutions $(a,b)$ where $c,f$ is intenger I made an edit since the ...
2
votes
0answers
36 views

Approximating real vectors in the unit hypercube by rational vectors in the unit hypercube

I am currently looking for an error bound for an problem where I have to approximate a real vector in the unit hypercube using a rational vector in the unit hypercube. Specifically: given a ...
2
votes
0answers
32 views

Intuition behind Khinchin's constant

Khinchin proved that For almost all reals $r$ with continued fraction representation $[a_o; a_1, a_2, \dots ]$ the sequence $K_n = \left(\prod_{i=1}^{n} a_i\right)^{1/n}$ converges to a ...
2
votes
0answers
52 views

Prove $a^m\equiv a^{m-\phi(m)}\pmod m$ for all positive integers

Prove that if $a,m$ are positive integers, then $$a^m\equiv a^{m-\phi(m)}\pmod m.\tag 1$$ If gcd$(a,m)=1$ then this is Euler's theorem. Denote gcd$(a,m)=k$ and $a=xk,m=yk$ then we need to prove ...
2
votes
0answers
28 views

Semiprime asymptotic step function

Since $$\pi_{(2)}(x)=\sum_{i=1}^{\pi(x^{1/2})}\left(\pi\left(\dfrac{x}{\text{p}_i}\right)-i+1\right),$$ where $\pi_{(2)}(x)$ denotes the semiprimes and $\text{P}_i$ is the $i$th prime, an asymptotic ...
2
votes
0answers
55 views

totally split primes in a number field

I have to show: For any number field $K$, there are infinitely many prime numbers $p \in \mathbb{N}$, that are totally split in $K$. I think have already shown (with some hints my professor gave) ...
2
votes
0answers
31 views

A generalisation of Roth's result on Diophantine approximation?

It is a celebrated result of Roth that algebraic numbers cannot be approximated by rationals too accurately: $\newcommand{\norm}[1]{\left\lVert #1 \right\rVert_{\mathbb{R}/\mathbb{T}}}$ Theorem ...
2
votes
0answers
28 views

Meaning of tamely ramified extension.

Let $K$ be a complete field with respect to a discrete nonarchimedean valutaion. We denote $A$ and $\mathfrak{p}$ as its valuation ring and valuation ideal, respectively. For a finite Galois extension ...
2
votes
0answers
70 views

Points in a general Cantor set

We often look at the Cantor set with the construction that keeps removing the middle thirds of the remaining line segments at each iteration. Corresponding to this construction, we can determine ...
2
votes
0answers
58 views

Birthday problem & primes

Let $\pi_k(n)$ be the almost prime counting function, then $\pi_k(2^kn)$ reaches a max value, since $\pi_k(2^kn)=\pi_{k+1}(2^{k+1}n)$ for large enough $k$. (eg, ...
2
votes
0answers
87 views

Questions about central polygonal numbers $1, 2, 4, 7, 11, 16, 22, 29, 37, 46,\cdots$

Formula for Central polygonal numbers is $\frac{n(n+1)}{2} + 1$, if $n=1$ or $n$ is prime, we get the new sequence $A$: 2, 4, 7, 16, 29, 67, 92, 154, 191, ... It seems that all primes either is ...
2
votes
0answers
43 views

Tau Summatory Function

It is well known that the divisor summatory function can be calculated in $O(x^{1/2})$ via $$D(x)=\sum_{n\le x} d(n) = 2 \sum_{k=1}^{\lfloor \sqrt{x}\rfloor} \lfloor\frac{x}{k}\rfloor - \lfloor ...
2
votes
0answers
37 views

Prime Triangle:: How to find the position(row and column) of prime number in a triangular arrangement

I was working on problem which asks the position of a prime number in a triangular arrangement. If we arrange the all prime up to 10^8 as shown in image we can find the row and column number of a ...
2
votes
0answers
68 views

Unexplanied pattern from increasing rational sequences

I've stummbled upon some strange pattern when working with series of rational numbers. If anyone could shed light on this phenomenon I will be most greatful. Backgroud: Working in an integer lattice ...
2
votes
0answers
212 views

Count swap permutations

Given an array A = [1, 2, 3, ..., n]: ...
2
votes
0answers
69 views

Find all pair(s) of positive integer $(a,b)$ such that $\frac{a^2}{2ab^2 -b^3+1}$ is also positive integer too?

Another number theory problem. I can find the small value of $b$ such that 0,1,2. But, I cannot find the upper limit of $b$, such that the value of $b$ is limited. How can I find the solution ...
2
votes
0answers
40 views

A better Reference than Andre Weil's Basic Number Theory

I want to get a feel for Adeles. I have been suggested to read the first 4 chapters of Andre Weil's Basic Number Theory. I am very confused by the writing style and conventions (like a field need not ...
2
votes
0answers
72 views

arithmetic sequence $8n+1$ and the collatz conjecture

Is it a known result that if for all $n$ the collatz sequence of $8n+1$ lead to $1$, all natural numbers will?
2
votes
0answers
30 views

binomial coefficents and composite numbers

Given a binomial coefficient $${n \choose k}$$ With $n>3$ and $k\neq 1$ or $n-1$, is the binomial cofficient always a composite number?
2
votes
0answers
33 views

Growth rate of arithmetical function

I'm interested in how one would estimate the growth rate of $$f(n)=\sum_{k\le n}\mu^2(k)\log(k)$$ I.e. sum of logarithms of square free integers. I can think of some trivial methods in my head ...
2
votes
0answers
60 views

Is this a conjecture or an already existing one??

Does the following inequality hold? $p(n)\leq 2^n,$ where $p(n)$ is the $n$th prime. If this is true then it follows that: If $p(n)=p(m)^x+p(o)^y$, then $\max[x,y] \le n$.
2
votes
0answers
53 views

Numbers for $k^{th}$ power of sum of digits equal the sum of digits of $k^{th}$ power

Let us denote $D_*(n)$ to be the sum of digits of $n$. Then we can find numbers satisfying the formula $$D_*(n^2)=D^2_*(n)$$ Like : $11^2 =121 ,\; \;(1+1)^2= 1+2+1$ , other like $12^2=144, \; \; ...
2
votes
0answers
77 views

Sum of $k$th power of first $n$ natural number (power sum)

I was working on a problem which involves computation power sum (summation of $k^{th}$ power of first natural number), can someone help me how to simplify the below equation. I can compute power sum ...
2
votes
0answers
61 views

Prove the inequality for composite numbers

Is it true that $c_m+c_n$ $>$ $c_{m+n}$ for all $m$, $n$ $\in$ $\mathbb{N}$? Though the result seems true, I can't get a solution. Even the bounds on $c_n$ obtained from Prime Number Theorem ...
2
votes
0answers
61 views

Formula for sequence of integers

I am trying to compute the Taylor series of $f(x) = \sqrt{-\ln(x)}$. I compute the derivatives of $f(x)$ and evaluate them in the point $x=1/e$. The resulting expressions have the following ...
2
votes
0answers
23 views

Asymptotics of the differences between successive zeta zeros

Does anyone know what the asymptotic of the differences between successive zeta zeros is? Update It appears that $\zeta(n)$ is not a bad asymptotic, when the data range is stretched: ...
2
votes
0answers
33 views

Subfactorial primes

So I just did some stuff and from what I can see, if y > x then !x + !y can only be prime if y = x+1 (apart from a few small exceptions near the start of the list. I don't know anything about ...