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 27456

Prime numbers, diophantine equations, diophantine approximations, analytic or algebraic number theory, arithmetic geometry, Galois theory, transcendental number theory, continued fractions

1 vote
1 answer
267 views

The maximum difference between the nth prime number and n x ln(n)

Is there an approximation for the maximum difference between P(n) and n x ln(n) as a function of n, where P(n) denotes the nth prime number? In other words, given D(n) = Max(|P(n) - n x ln(n)|), is t …
barak manos's user avatar
10 votes
1 answer
2k views

A conjecture in Number Theory

Hi all. I've had this idea - a conjecture in the field of Number Theory - for a few years now. The conjecture is rather simple, as were the logical steps that I made in order to infer it, so I would …
barak manos's user avatar
3 votes
3 answers
619 views

Conjecture about a sequence of natural numbers, such that, $\forall n : A_n<P_n<A_{n+1}$

Conjecture - no natural number $k$ exists such that: $P$ is the sequence of all primes starting from the $k$th prime $A$ is a sequence of natural numbers such that: $\forall n : A_n<P_n<A_{n+1}$ $ …
barak manos's user avatar
0 votes
2 answers
835 views

Mersenne Prime Sequences

Hi. Given the following sequence (of Mersenne primes): $ A_{1} = 2 $ $ A_{n} = 2^{A_{n-1}} - 1 $ The first five elements are all prime numbers: $ 2 $ $ 2^{2}-1=3 $ $ 2^{3}-1=7 $ $ 2^{7}-1=127 …
barak manos's user avatar
2 votes
2 answers
289 views

What is the minimal range $[f(n),g(n)]$ that contains a prime number for every integer $n>0$?

I know the following: Proven: There is a prime number between $n$ and $2n$ for every integer $n>0$. Conjectured: There is a prime number between $n^2$ and $(n+1)^2$ for every integer $n>0$. My que …
barak manos's user avatar
2 votes
1 answer
659 views

Number of primes with $-1\pmod 6$ vs. Number of primes with $+1\pmod 6$

Have not been able to get an answer to this on http://math.stackexchange.com, so trying here too... Given the following two sets: $P^-(n) = \{p \leq n : p \equiv -1\pmod 6\}$ $P^+(n) = \{p \leq n …
barak manos's user avatar
2 votes
1 answer
351 views

Conjecture on prime numbers

Given a prime $p$, let $a_n=pn+n-1$. I have noticed that $\forall{p}\exists{n}\in[2,p]:a_n\in\mathbb{P}$. For example: $p=7,a_3=23,a_4=31,a_6=47$. What is this conjecture called, and has it been pr …
barak manos's user avatar
2 votes
1 answer
2k views

Conjecture on the square root of the sum of the squares of the prime factors of a number

Let $A_{n}$ denote the square root of the sum of the squares of the prime factors of $n$. For example, $A_{60}=\sqrt{2^2+2^2+3^2+5^2}\approx6.48$. I have recently made the following observations: …
barak manos's user avatar
4 votes
0 answers
625 views

A "Take a Square Root When You Can" conjecture related to the prime factorization

I would tend to think that the following has already been investigated. But as implied from the title, I have no idea how to even start looking for it. Let $P_n$ denote the sum of the squares of t …
barak manos's user avatar