Re: Research prime's number




"jinhyun" <jinhyunshyam@xxxxxxxxx> wrote in message
news:1178456769.471449.149990@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
On May 6, 1:12 pm, Vincenzo Librandi <vincenzo.librandw...@xxxxxxxx>
wrote:
Is (n) the odd numbers.
If the couple it's made up of two numbers
addition =(n) to no admit common's divisor,
then(n) is prime number.

example:
(n) = 23
The couple (2,21), (3,20), (4,19), (5,18),
(6,17), (7,16),(8,15), (9,14), (10,13), (11,12);
no admit common's divisor then (n)=23 is prime number.

(n) = 15
The couple (2,13),(3,12),(4,11),(5,10),(6,9),(7,8);
admit (3,12),(6,9) divisor 3; and (5,10) divisor 5.
Then 15 = 3*5

Who explain it ?

Good bye
Vincenzo Librandi
vincenzo.librandw...@xxxxxxxx

Is 4+5 prime?

You miss understood his badly made claim if I understand it correctly from
his examples. I think he is trying to say that n is prime iff when written
as a sum of 2 positive integers then there is never a pair with a common
divisor. He already knew 9 was not prime by his claim as 9=3+6 and they
have a common divisor of 3. Of course his claim is easily seen to be true
and not of any real value. (n is not prime iff n=jk where jk and integers
1. Write n as j(k-1) + j and j is a common divisor of j(k-1) and j. If is
prime, one cannot write it as the sum of two numbers with a common divisor
(>1) or it would not be prime: n=ac+bc=c(a+b) and hence not prime.




.



Relevant Pages

  • Re: Research primes number
    ... Vincenzo Librandi writes: ... no admit common's divisor then =23 is prime number. ... /In God We Trust, Inc./. ...
    (sci.math)
  • Re: Why is it called a Divisor?
    ... In their original context of number fields, "divisor" comes from ... For a polynomial with integer coefficients, ... to be the greatest common divisor of the coefficients. ... We want the same to be true for polynomials with ...
    (sci.math)
  • Re: Newbie question(s)...
    ... > contradiction; assume that for a prime number, ... numbers such that the greatest common divisor of n an m is 1. ... also be the case that p divides n (because the exponent for each prime ...
    (sci.crypt)
  • Re: Adding Fractions Problem
    ... numerator is a divisor of the denominator, you should check to see if ... Create a variable called remainder set equal to 1 ... Once you know that the greatest common divisor of the numbers is ... then just divide numerator and denominator by the ...
    (comp.lang.java.help)
  • Ring ideals
    ... Let R be a commutative unitary ring, a an element of R, and n,m two ... positive integers. ... If d = = the max. com. divisor of n,m, then ... other contention. ...
    (sci.math)