Goldbach‘s Conjecturehttps://en.wikipedi...bach%27s_conjecture Every even integer greater than 2 can be expressed as the sum of two primes. [kdf, Jun 27 2020]

Please log in.
If you're not logged in,
you can see what this page
looks like, but you will
not be able to add anything.

Welcome to the HB [latte] Could you take the time and trouble to rephrase your "idea" so that it becomes an actual idea?
eg "idea for a mathematical formula that quickly and easily determines if a number is prime based on a count of its digits"

You then outline the halfbaked method of acheiving the outcome you have outlined. The emphasis here is on it being halfbaked, otherwise it's not by definition a halfbaked idea! Meanwhile, have this croissant [+] to cancel out the bone someone sent you as a welcoming gift. No new member should start off here with a bone (my first post attracted 6 bones so I know how it feels)

[kdf] [Voice] that is what I want to find out, I was exploring links between prime numbers within logarithmic upper and lower bounds and then I noticed this 100 - 3 = 97, 100 - 87 = 13 (97 - 10 = 87 & 13 - 10 = 3), then the flipping between digit symbols 13 to 31 & 37 to 73 & 79 to 97 with 43 & 67 being the odd ones out (original post had 41 & 59, sorry). I don't know what it means, I've been seeking feedback....

[pocmloc] you should have seen the haskell line that does the same thing, I don't remember it, it's been a while.

[xenzag] Thank you, I had a pain au chocolat this morning every bite dipped in coffee...

Has anybody seen this before ?

Sorry for the late reply, I'm still getting to know the UI.

Welcome, [latte]. I'm not sure what this idea means, but the
attempt to understand it woke up my brain on a slow morning so
you've done me a favour already. [+]

i don’t know if it “means” anything. But it might
help you to look up some existing theorems and
conjectures about primes - you might be reviewing
something already known.

Start with Goldbach’s conjecture (link) which
posits every even integer greater than 2 can be
expressed as the sum of two primes. It doesn’t
touch on everything you mentioned - but it’s no
surprise you can subtract a prime from 100, or
1000, etc and have a prime left over.

i don’t know if it “means” anything. But it look up
some existing theorems and conjectures about
primes - you might be reviewing
something already known. Start with Goldbach’s
conjecture (link) ... It doesn’t
touch on everything you mentioned - but it’s no
surprise you can subtract a prime from 100, or
1000, etc and have a prime left over.

pocmloc - not just any prime. There are some pairs
of primes that add up to 100, but 100-(some
prime) does not always leave (some other prime). -

That may be part what latte was going on about.
His complete idea wasn’t clear to me ... but any
discussion of special classes of numbers usually
makes me eyes glaze over pretty quickly.

I think the thing to do would be to work out whether there was an excess
of 'paired primes' over that expected by chance.
So you'd choose a range - I think preferably not overlapping with its
mapping. Then you can determine the number of paired primes, divide
this by the number of primes present in the range, and compare that to
the fraction of numbers in the mapped range which are prime.

I preliminarily did this for n=1, and did see a small excess - which didn't
look particularly convincing (also it was very late at night; E&OE). To
interest a mathematician I think you'd need to show there was a
consistent trend. Easy route would use a short program and a list of
primes found on the internet - I found a reasonably formatted list of the
first 100,000 with a little searching, so that's doable.

I think you should look at the patterns produced
using other number bases. The use of base 10 is
embedded within your formula, yet prime numbers
have no number base bias.