Divisor Goldbach Conjecture and its Partition Number
... Proof 3.1 If n/m = 2, obviously the set Sm|n has an element s = (p1 , p2 , ..., pm ) with pi (i = 1, 2, ..., m) = 2. So, in this case the conjecture 2.2 is correct. Next, we prove Y (m, 2m) ≡ 1. Since Y (m, 2m) = Card(Sm|2m ), we have to prove Card(Sm|2m ) ≡ 1, equivalently, the set Sm|2m has only o ...
... Proof 3.1 If n/m = 2, obviously the set Sm|n has an element s = (p1 , p2 , ..., pm ) with pi (i = 1, 2, ..., m) = 2. So, in this case the conjecture 2.2 is correct. Next, we prove Y (m, 2m) ≡ 1. Since Y (m, 2m) = Card(Sm|2m ), we have to prove Card(Sm|2m ) ≡ 1, equivalently, the set Sm|2m has only o ...
ARE THERE INFINITELY MANY TWIN PRIMES
... develop mathematics not just as an empirical science, but as an axiomatic system for logical deductions.2 In Euclid we find in place of the above scientific observation the following deduction. 1While one could argue that 1 itself should be a prime, most mathematicians prefer to put 1 in a class by ...
... develop mathematics not just as an empirical science, but as an axiomatic system for logical deductions.2 In Euclid we find in place of the above scientific observation the following deduction. 1While one could argue that 1 itself should be a prime, most mathematicians prefer to put 1 in a class by ...
