 |
||||||
Topic, The topic where you can only post the most random things you can think of that doesn't make sense... | ||||||
| ||||||
You must register or log in to post a message.   *is blocked once again by parental controls*  get this, you take a number 0-15, multiply it by 16 to the power of a number bigger than 2, double it, add one, and the result is always prime...try it :P for instance: 13*(16^10)*2+1=28587302322177 my prime finder(which uses the brick wall method) shows this as prime... 5*(16^3)*2+1=2561 - prime 1*(16^8)*2+1=8589934593 - prime 15*(16^7)*2+1=8053063681 - prime this is my developed findings of how multiplication works in binary, every prime number will not have a set of repeating binary patterns through the whole number(excluding stuff like 7[111] because just 1 doesnt count as a pattern, but not excluding 15[1111] because 11 is a pattern) and every number which has a pattern throughout the whole number is not prime. enjoy my findings :P [edit] this can also be edited by changing the brackets: number from 0-7 with (8^n) number from 0-31 with (32^n) could be anything as long as a in (a^n) is not 1 or 2... [edit] have I just cracked the prime code there o.O [re-edit] ok the method for working out if a number is prime doesnt work fully, but the generator does...see other topic ^^ [re-re-edit] go to other topic, ive changed the requirements for the function :P          | ||||||
