The main purpose of this paper is to study the mean value properties of thesecond Smarandache pseudo-odd number sequence and pseudo-even number sequence, andgive some interesting asymptotic formula for them.
In this paper we present some results connected with still open problem of Gauss, negative Pell’s equation and some type graphs.In particular we prove in the Theorem 1 that all real quadratic fields K=Q( ) , generate...In this paper we present some results connected with still open problem of Gauss, negative Pell’s equation and some type graphs.In particular we prove in the Theorem 1 that all real quadratic fields K=Q( ) , generated by Fermat’s numbers with d=Fm+1=22m+1+1,m≥2, have not unique factorization. Theorem 2 give a connection of the Gauss problem with primitive Pythagorean triples. Moreover, in final part of our paper we indicate on some connections of the Gauss problem with odd graphs investigated by Cremona and Odoni in the papper [5].展开更多
In this paper, we find two integers k0, m of 159 decimal digits such that if k ≡ k0 （mod m）, then none of five consecutive odd numbers k, k - 2, k - 4, k - 6 and k - 8 can be expressed in the form 2^n ± p^α, ...In this paper, we find two integers k0, m of 159 decimal digits such that if k ≡ k0 （mod m）, then none of five consecutive odd numbers k, k - 2, k - 4, k - 6 and k - 8 can be expressed in the form 2^n ± p^α, where p is a prime and n, α are nonnegative integers.展开更多
This article presents very original and relatively brief or very brief proofs about of two famous problems: 1) Are there any odd perfect numbers? and 2) “Fermat’s last theorem: A new proof of theorem and its general...This article presents very original and relatively brief or very brief proofs about of two famous problems: 1) Are there any odd perfect numbers? and 2) “Fermat’s last theorem: A new proof of theorem and its generalization”. They are achieved with elementary mathematics. This is why these proofs can be easily understood by any mathematician or anyone who knows basic mathematics. Note that, in both problems, proof by contradiction was used as a method of proof. The first of the two problems to date has not been resolved. Its proof is completely original and was not based on the work of other researchers. On the contrary, it was based on a simple observation that all natural divisors of a positive integer appear in pairs. The aim of the first work is to solve one of the unsolved, for many years, problems of the mathematics which belong to the field of number theory. I believe that if the present proof is recognized by the mathematical community, it may signal a different way of solving unsolved problems. For the second problem, it is very important the fact that it is generalized to an arbitrarily large number of variables. This generalization is essentially a new theorem in the field of the number theory. To the classical problem, two solutions are given, which are presented in the chronological order in which they were achieved. <em>Note that the second solution is very short and does not exceed one and a half pages</em>. This leads me to believe that Fermat, as a great mathematician was not lying and that he had probably solved the problem, as he stated in his historic its letter, with a correspondingly brief solution. <em>To win the bet on the question of whether Fermat was telling truth or lying, go immediately to the end of this article before the General Conclusions.</em>展开更多
In this paper, we consider <i>r</i>-generalization of the central factorial numbers with odd arguments of the first and second kind. Mainly, we obtain various identities and properties related to these num...In this paper, we consider <i>r</i>-generalization of the central factorial numbers with odd arguments of the first and second kind. Mainly, we obtain various identities and properties related to these numbers. Matrix representation and the relation between these numbers and Pascal matrix are given. Furthermore, the distributions of the signless r-central factorial numbers are derived. In addition, connections between these numbers and the Legendre-Stirling numbers are given.展开更多
Define the total number of distinct prime factors of an odd perfect number n asω(n). We prove that if n is an odd perfect number which is relatively prime to 3 and 5 and7, then ω(n) ≥ 107. And using this result, we...Define the total number of distinct prime factors of an odd perfect number n asω(n). We prove that if n is an odd perfect number which is relatively prime to 3 and 5 and7, then ω(n) ≥ 107. And using this result, we give a conclusion that the third largest prime factor of such an odd perfect number exceeds 1283.展开更多
文摘The main purpose of this paper is to study the mean value properties of thesecond Smarandache pseudo-odd number sequence and pseudo-even number sequence, andgive some interesting asymptotic formula for them.
文摘In this paper we present some results connected with still open problem of Gauss, negative Pell’s equation and some type graphs.In particular we prove in the Theorem 1 that all real quadratic fields K=Q( ) , generated by Fermat’s numbers with d=Fm+1=22m+1+1,m≥2, have not unique factorization. Theorem 2 give a connection of the Gauss problem with primitive Pythagorean triples. Moreover, in final part of our paper we indicate on some connections of the Gauss problem with odd graphs investigated by Cremona and Odoni in the papper [5].
基金the National Natural Science Foundation of China,Grant No 10471064 and 10771103
文摘In this paper, we find two integers k0, m of 159 decimal digits such that if k ≡ k0 （mod m）, then none of five consecutive odd numbers k, k - 2, k - 4, k - 6 and k - 8 can be expressed in the form 2^n ± p^α, where p is a prime and n, α are nonnegative integers.
文摘This article presents very original and relatively brief or very brief proofs about of two famous problems: 1) Are there any odd perfect numbers? and 2) “Fermat’s last theorem: A new proof of theorem and its generalization”. They are achieved with elementary mathematics. This is why these proofs can be easily understood by any mathematician or anyone who knows basic mathematics. Note that, in both problems, proof by contradiction was used as a method of proof. The first of the two problems to date has not been resolved. Its proof is completely original and was not based on the work of other researchers. On the contrary, it was based on a simple observation that all natural divisors of a positive integer appear in pairs. The aim of the first work is to solve one of the unsolved, for many years, problems of the mathematics which belong to the field of number theory. I believe that if the present proof is recognized by the mathematical community, it may signal a different way of solving unsolved problems. For the second problem, it is very important the fact that it is generalized to an arbitrarily large number of variables. This generalization is essentially a new theorem in the field of the number theory. To the classical problem, two solutions are given, which are presented in the chronological order in which they were achieved. <em>Note that the second solution is very short and does not exceed one and a half pages</em>. This leads me to believe that Fermat, as a great mathematician was not lying and that he had probably solved the problem, as he stated in his historic its letter, with a correspondingly brief solution. <em>To win the bet on the question of whether Fermat was telling truth or lying, go immediately to the end of this article before the General Conclusions.</em>
文摘In this paper, we consider <i>r</i>-generalization of the central factorial numbers with odd arguments of the first and second kind. Mainly, we obtain various identities and properties related to these numbers. Matrix representation and the relation between these numbers and Pascal matrix are given. Furthermore, the distributions of the signless r-central factorial numbers are derived. In addition, connections between these numbers and the Legendre-Stirling numbers are given.
基金Foundation item： Supported by the Science Foundation of Kashgar Teacher＇s College（112390）
文摘Define the total number of distinct prime factors of an odd perfect number n asω(n). We prove that if n is an odd perfect number which is relatively prime to 3 and 5 and7, then ω(n) ≥ 107. And using this result, we give a conclusion that the third largest prime factor of such an odd perfect number exceeds 1283.
