
#19
Apr311, 09:48 AM

P: 3

In this case the number as a whole changes from 11 to 11/3! but 11 itself doesn't change at all. If it were 25 and I divided it by 120 it would change to 5 and not remain the same. Basically I can write a fraction of X/(Square root of X rounded down)! on a piece of paper or calculator and change it to smaller numbers on both sides of the division line by either myself or the calculator if it is not prime.




#20
Apr311, 11:59 AM

P: 70

I believe PrimeNumbers wants to say that if [tex]GCD(N,[\sqrt{N}]!) = 1[/tex] then N is prime.




#21
Apr311, 12:20 PM

HW Helper
P: 805





#22
Apr311, 12:41 PM

P: 70

Clearly it's not computational feasible for large numbers, however there are some interesting results for example if [tex]gcd(N, [\sqrt{N}]!) = P, P > 1[/tex] then P is a factor of N.
It could become computational feasible if someone finds good algorithms for adding, subtracting and finding modulus that work in the factorial base (Cantor discovered that we can write any number in factorial base, for example 15 = 1! + 1*2! + 2*3!). Because we can easily find the representation of N in factorial base all we would need is fast computational algorithms for this base. P.S. EIRE2003 see how many interesting questions are prime numbers raising? This kind of questions and their answers have made great improvements allover mathematics! Those numbers look uninteresting until you ask a question about them, try it. 



#23
Apr311, 06:12 PM

PF Gold
P: 1,930





#24
Apr311, 07:42 PM

HW Helper
P: 1,932

It was surely not for any of the applications that have been mentioned. It was cultivated for centuries before they were dreamt of. And also prime numbers specifically are not really essentially connected with cryptography. It is just that factorisation into prime numbers is one, just one, example of a hard (computationally very long) problem whose inverse (multiplying the factors) is not hard, if I understand. There are other such hard problems ready to take over for cryptography if ever anyone cracks the factorisation problem.
I think of it as having a pile of pebbles, can I arrange them in a regularly spaced rectangle? If not I have a prime number of pebbles. Could be tempted to wonder if it is worthy of a grown man's attention. Tempted to believe that it would be if it were simple  could be explained, followed, carried in the head it would be revealing of a structure. But if it is so difficult and complicated that no one understands the solution when it is found, will it be revealing in the same way? I believe this question is discussed about some of today's very difficult proofs. Unless it throws light on other problems whose significance is more apparent. We are told this would be so, but I suggest we do need to be told. 



#25
Apr611, 10:02 AM

P: 221

can someone post the proof please? 


Register to reply 
Related Discussions  
Prime Numbers: (2^n  1) and (2^n + 1)  Calculus & Beyond Homework  6  
a prime number which equals prime numbers  General Math  10  
A formula of prime numbers for interval (q; (q+1)^2), where q is prime number.  Linear & Abstract Algebra  0  
Prime Numbers in the Diophantine equation q=(n^2+1)/p and p is Prime  Linear & Abstract Algebra  5  
Prime Numbers  Linear & Abstract Algebra  44 