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)

0
votes
0answers
15 views

Different methods used to show the existence of integer solutions

Let $A_{n},B_{n},C_{n}$ be three sequences of positive integers. I want to know the different methods used to show the existence of integer solutions $x$ and $y$ for the equation: ...
1
vote
1answer
140 views
+50

How to calculate this sum like Gauss sum.

I would like to calculate the following sum, which looks like a Gauss sum. Let $n$ be a natural number and let $a,b$ be integers. Denote by $e(x)=e^{2\pi i x/n}$. Consider the sum $$ \sum_{1 \leq j, ...
5
votes
2answers
295 views

If $m^4+4^n$ is prime, then $m=n=1$ or $m$ is odd and $n$ even

I have been stuck on this one for months, really simple to state, really giving me trouble. Show that if $m^4 + 4^n$ is prime, $m>0$, $n>0$, then $m$ is odd and $n$ is even, except when ...
7
votes
2answers
58 views

A number $N$ is a $k$-nacci number if and only if …

For $k\ge 2\in\mathbb N$, one can define the $n$-th $k$-nacci number $f_k(n)\ (n=0,1,\cdots)$ as $$f_k(0)=f_k(1)=\cdots=f_{k}(k-2)=0,\ \ ...
2
votes
0answers
18 views

Solving A Certain Diophantine Equation

I am stack on finding the solution of the diophantine equation: $d(2^{k+1}-1)-b^2(2^{k+1}-2)=1$. where $k\geq 1$ and $b^2>d$ for $b$ an odd composite integer. Is there a solution to this ...
10
votes
1answer
88 views

Are $121$ and $400$ the only perfect squares of the form $\sum\limits_{k=0}^{n}p^k$?

I've been looking for perfect squares that can be represented as $\sum\limits_{k=0}^{n}p^k$. Of course, both $n$ and $p$ should be natural numbers larger than $1$. Searching up to $n=100$ and ...
2
votes
0answers
77 views

How to prove this??

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$.
0
votes
0answers
28 views

Number theory and Group theory [on hold]

Can you give me any task which contains Number theory and Group theory?
2
votes
2answers
198 views
0
votes
1answer
32 views

All possible number combinations in decimal represenation of irrational numbers?

This question is directly inspired by "Does Pi contain all possible number combinations?". I would like to state firstly for the record that I have no serious number theory education. I think I ...
0
votes
2answers
46 views

Prove if $ord_p(d) < ord_p(n)$ then d divides n

I have to prove that $d$ divides $n$ if and only if $ord_p(d)\leq ord_p(n)$ I have already proved that $ord_p(d)\leq ord_p(n)$ if $d$ divides $n$ but I am struggling to prove the converse. Can ...
4
votes
1answer
68 views

The number of divisors of a number whose sum of divisors is a perfect square

Let $n$ denote a non-prime whose sum of divisors is a perfect square. I have noticed a few surprising facts on the number of divisors of $n$: It is either prime or semi-prime or $27$ in all cases ...
0
votes
0answers
21 views

e Online source for alternative proofs

I'm looking for some alternative proofs for various theorems. My goal is to compile a list of various proofs each relating to a specific theorem (such as the triangle inequality, Fermat's Little ...
4
votes
0answers
63 views

Are there infinitely many $N^3$ (especially for prime $N$) that cannot be expressed as a sum of three positive cubes?"

Well few days ago i asked a question on perfect numbers and Tito Piezas III answered the question in a very intriguing way which has helped me to get a lead on it.But his answer and perfect numbers ...
1
vote
1answer
18 views

Asymptotic formula for sums related to primes

Suppose $0 < \alpha < 1$. What is the asymptotic formula for the sum $$\displaystyle \sum_{p \leq x} \frac{\log p}{p^\alpha}?$$ Thanks for any insights.
1
vote
2answers
47 views

Collatz conjecture: Largest number in sequence with starting number n

This question is inspired by a CS course, and it only tangentially relates to the actual content of the exercise. Say in a hailstone sequence (Collatz conjecture) you start with a number n. For any ...
2
votes
1answer
24 views

Asymptotic formula for sums of powers of reciprocals of primes

Is there an explicit asymptotic formula, in terms of $\alpha$, for the expression $$\displaystyle \sum_{p \leq x} \frac{1}{p^\alpha}$$ for $0 < \alpha < 1$? The case $\alpha = 1$ is supplied by ...
0
votes
0answers
15 views

On a congruence for the number of finite topologies

I am making search about "On a congruence for the number of finite topologies". I have found a paper. I guess it is written in Russian. How can I find English version of this paper ? I am also ...
40
votes
1answer
777 views

Are there infinite many $n\in\mathbb N$ such that $\pi(n)=\sum_{p\leq\sqrt n}p$?

Are there infinite many $n\in\mathbb N$ such that $$\pi(n)=\sum_{p\leq\sqrt n}p,\tag{1}$$ where $\pi(n)$ is the Prime-counting_function? For example, ...
0
votes
1answer
39 views

What books do you recommend on mathematics behind cryptography?

I am currently reading the Book Understanding Cryptography from Cristof Paar. I am enjoying the book but i don't like to scratch the surface when it comes to cryptography. I would like do dig a little ...
2
votes
1answer
23 views

Origin of period function model of primes

There is a web page attributed to Omar Pol, "Sobre el patrón de los números primos: Determinación geométrica de los números primos y perfectos." ("On the pattern of primes: Geometric Determination of ...
6
votes
4answers
160 views

Prove that $\log_{36} 30 $ is irrational number.

Prove that $\log_{36} 30 $ is irrational number. We can suppose that $\log_{36} 30 $ is rational number. So we have that $\log_{36} 30 = \frac{p}{q}$ where $\gcd(p,q) = 1$. By definition of logarithm ...
3
votes
1answer
265 views

If two primes differ by $n$, then infinitely many primes differ by $n$

A proof I'm writing rests on something I can't prove, probably beyond my knowledge, but it seems right: For any two primes $p_k, p_l$ (not necessarily consecutive) such that the distance between ...
1
vote
0answers
21 views

Nebentypus of contragredient representation

Let $k$ be a local non-archimedean field with ring of integers $\cal O$ and maximal ideal $\frak p$. Let $\pi$ be an irreducible admissible $\infty$-dimensional representation of $\text{GL}_2(k)$ ...
5
votes
3answers
145 views

Diophantine equations and Hilbert's 10th Problem, how did MRDP do it?

I'm having a bit of trouble understanding the Wiki explanation of MRDP's (Matiyasevich, Robinson, Davis, Putnam)'s Theorem, which explains that Hilbert's 10th problem is unsolvable. The MRDP ...
0
votes
0answers
15 views

How to expand powers of multiple pairwise commuting elements in a group [on hold]

Let (G, $\ast$) be a group and let n $\in\aleph$. Prove that if $g_1,...,g_k\in G, k\in\aleph$ are pairwise commuting elements of G, then $(g_1\ast...\ast g_k)^n$=$g_1^n\ast ...\ast g_k^n$
22
votes
2answers
699 views

How to define addition through multiplication?

One might define multiplication $\bullet$ on $\mathbb Z$ as follows: $\bullet: \mathbb Z\times \mathbb N\ni (a,b) \mapsto a+\cdots+a\in \mathbb Z$ where we add $b$ times. But suppose we are in a ...
35
votes
1answer
1k views

Why does this test for Fibonacci work?

In order to test if a number $A$ is Fibonacci, all we need to do is compute $5A^2 + 4$ and $5A^2 -4$. If either of them is a perfect square, the number is Fibonacci, otherwise not. Why does this test ...
0
votes
1answer
25 views

How to solve second order congruence equation if modulo is not a prime number

the equation is $x^2 = 57 \pmod{64}$ I know how to solve equations like (*) $ax^2 +bx +c = 0 \pmod{p}$, where $p$ is prime and i know all the definitions for like Legendre's Symbol and all of the ...
52
votes
0answers
731 views

Is There An Injective Cubic Polynomial $\mathbb Z^2 \rightarrow \mathbb Z$?

Earlier, I was curious about whether a polynomial mapping $\mathbb Z^2\rightarrow\mathbb Z$ could be injective, and if so, what the minimum degree of such a polynomial could be. I've managed to ...
0
votes
1answer
19 views

Proofed: Every number in the sequence of powers of 2 have $phi = 1/2 * 2^x$

I want to know if it's proofed, that every number which is in the number sequence of the powers of $2$ has an $\phi$ of $\frac12x$.
0
votes
1answer
30 views

Induction proof involving Euler Totient Function

Let $\varphi$ be the Euler totient function Qi) show that if $r$ is a power of a prime number then $\sum_{d|r} \varphi(d) = r.$ Qii) Show that if $n \geq 2$ then there is a decomposition of n as a ...
3
votes
1answer
75 views

Trying to understand a step in Ramanujan's Proof of Bertrand's Postulate regarding the gamma function

My question relates to this step in the proof here: But it is easy to see that $$\log \Gamma(x)-2\log\Gamma(\frac12x+\frac12) \le \log\left\lfloor ...
0
votes
0answers
15 views

Understanding how to estimate $\pi(x)$ based on Paul Erdos's proof of Bertrand's Postulate

I am reading the 4th Edition of Proofs from the Book. I am not clear on how the proof behind Bertrand's postulate leads to the following statement on page 10 (of my edition): From (2) one can ...
2
votes
0answers
56 views

What is the relationship between GRH and Goldbach Conjecture?

We know that we can prove weak Goldbach Conjecture (three prime theorem) if we assume GRH (Hardy-Littlewood had proved this). Can we also prove strong Goldbach Conjecture if we assume GRH ? Also, ...
2
votes
0answers
57 views

Any heuristic explanation on why sieve methods can not prove Goldbach conjecture?

Any heuristic explanation on why sieve methods can not prove strong Goldbach conjecture ? I remember that Terence Tao published a blog and gave an heuristic explanation on why circle methods very ...
1
vote
0answers
25 views

what is the best Schnirelmann Constants?

what is the best Schnirelmann Constant for Goldbach Conjecture ? On http://mathworld.wolfram.com/SchnirelmannConstant.html the best Schnirelmann Constant is 7 ( from Ramaré ) My understanding is ...
14
votes
2answers
275 views

Numbers that are divisible by the number of primes smaller than them

Let $\pi(n)$ denote the number of primes less than or equal to $n$ (a.k.a the prime-counting function). For certain values of $n$, the value of $\frac{n}{\pi(n)}$ is integer. Here are the first few ...
0
votes
0answers
29 views

Clever use of Pell's equation

Find infinitely many triples $(a,b,c)$ of positive integers such that $a,b,c$ are in arithmetic progression and such that $ab+1$, $bc+1$, and $ca+1$are perfect squares. The solution is: Consider the ...
0
votes
0answers
27 views

Strict total ordering

I'm not able to understand how the below relation is example of "strict total order". Consider a set $X = 2^Y$ where $Y = \{1,2,3,4,5,6,7,8,9\}$. The expected order of $X$ is for all $x, y$ ...
3
votes
1answer
39 views

Two question about ${\mathbb Q}(\alpha)$ for $\alpha$ := $\sqrt[n]{7}$ + $\sqrt[n+3]{7}$

Let $\alpha$ = $\sqrt[n]{7}$ + $\sqrt[n+3]{7}$ with $n$ not divisible by $3$. Prove that $[{\mathbb Q}(\alpha) : {\mathbb Q}] = n(n + 3)$. Conclude that $\alpha$ is constructible if and only if $n = ...
0
votes
1answer
12 views

Partition of fractional parts where each sum of them has to be at least 1

Let $ a_1,\ldots,a_t \in \mathbb{Q} \setminus \mathbb{Z} $ be with $ \sum_{i=1}^t \lbrace a_i \rbrace \in \left[k,k+1\right) $ for some $ k \in \mathbb{N} $ with $ k \ge 4 $. Here $ \lbrace x \rbrace ...
5
votes
1answer
164 views

Can the cube of every perfect number be written as the sum of three cubes?

I found an amazing conjecture: the cube of every perfect number can be written as the sum of three positive cubes. The equation is $$x^3+y^3+z^3=\sigma^3$$ where $\sigma$ is a perfectnumber (well it ...
3
votes
1answer
338 views

Prove that ${\sqrt2}^{\sqrt2}$ is an irrational number without using a theorem.

Prove that ${\sqrt2}^{\sqrt2}$ is an irrational number without using the Gel'fond-Schneider's theorem. I'm interested in this problem because I knew that ${\sqrt2}^{\sqrt2}$ is a transcendental ...
13
votes
3answers
223 views

A conjecture: for all $n\in\mathbb{N}$, the least $k>1$ such that $\phi(k)\geqslant n$ is a prime

I came across a problem in book that asked us to find the first number $n$ such that $\phi(n)\geqslant 1,000$ it turns out that the answer is 1009, which is a prime number. There were several ...
2
votes
1answer
61 views

Multiples of 3 and 5. [on hold]

If we have the Tartaglia(Pascal) triangle in every row which numers are multiples of 3 which are even and which are multiples of 5?
3
votes
1answer
43 views

Finitely Many Extensions of Fixed Degree of a Local Field

How does one show that there are only finitely many degree $n$ extensions of a local field? I understand how this follows from class field theory in the Abelian case but don't understand how to do the ...
8
votes
1answer
193 views

Identity in Number Theory Paper

In this paper by Jerry Hu, he defines the function $$f_{s,k,i}\left(u\right)=\prod_{p\mid u} \left(1-\frac{\sum_{m=i}^{k-1}{s \choose m}\left(p-1\right)^{k-1-m}}{\sum_{m=0}^{k-1}{s \choose ...
16
votes
2answers
224 views

Möbius function of consecutive numbers

This question arose from a problem in Niven & Zuckerman's book "Introduction to the Theory of Numbers". In the chapter that the authors introduce the Möbius function, the first exercise is the ...
0
votes
1answer
20 views

Understanding Bézout's identity

I'm trying to understand a proof of Bézout's identity ($gcd(a,b)=$ smallest linear combination of $a$ and $b$), and I'm having some trouble following the last step. The proof goes by: Let $m=sa+tb$ ...