\[\sigma(n+1)-\sigma(n-1)=2\]
twin primes?
what is a question? :)
idk if this is true for anything other than twin primes
Wow, Is that too easy ha !
can you specify more clearly sigma and n?
\(\sigma(n) = n+1 \iff \text{ n is prime}\)
yes, I see that but I'm trying hard to check why it cannot be something of this form\[\sigma(n+1) = n+1 + k\]\[\sigma(n-1) = n-1 + k\]that is to say that the proper divisors have the same sum. let me think.
Interesting...
:/ what we need to do in this question tho?..
@sparrow2 \(\sigma\) is the sum of divisors function http://mathschallenge.net/library/number/sum_of_divisors
sigma function is defined for positive integers and its minimum value is 1 and for \(\sigma(x)=1\) ; x=1 so for \(\sigma(n-1)+\sigma(n+1)=2\) both (n-1) and (n+1) must be 1 and this is not possible
you answered a different question lol
which question are we solving?
so we are trying to prove that sigma(n)=n+1 is working only for primes?
ok I will write a quick program to find non-primes with the same property
@ParthKohli 435 is the first counter example it seems
oh you already did it. great :)
Are there infinitely many counter examples? Are there nontwin primes that satisfy the equation AND also satisfy this equation? \[\tau(n+1)=\tau(n-1)\]
if you plug n=4 : sigma(5)-sigma(3)=6-4=2.. is 4 also solution?
Yeah, it definitely is @sparrow2 :D
then every n,there n+1 and n-1 are primes are solutions too,there are many solution
Yeah, when \(n+1\) and \(n-1\) are primes, these are called twin primes, so you just found 3 and 5 are twin primes, another pair of twin primes is 11 and 13.
less then 1000 there are 36 solutions :D
if my program works well :D i'm sure it works
are twin primes infinite?
oh ist's unsolved :D
Ok so well you might have found it yourself because that formula works well for prime numbers only....
Join our real-time social learning platform and learn together with your friends!