**Previous months:**

2007 - 0703(3) - 0706(2)

2008 - 0807(1) - 0809(1) - 0810(1) - 0812(2)

2009 - 0901(2) - 0904(2) - 0907(2) - 0908(4) - 0909(1) - 0910(2) - 0911(1) - 0912(3)

2010 - 1001(3) - 1002(1) - 1003(55) - 1004(50) - 1005(36) - 1006(7) - 1007(11) - 1008(16) - 1009(21) - 1010(8) - 1011(7) - 1012(13)

2011 - 1101(14) - 1102(7) - 1103(13) - 1104(3) - 1105(1) - 1106(2) - 1107(1) - 1108(2) - 1109(2) - 1110(5) - 1111(4) - 1112(4)

2012 - 1201(2) - 1202(13) - 1203(7) - 1204(9) - 1205(7) - 1206(6) - 1207(5) - 1208(5) - 1209(11) - 1210(15) - 1211(10) - 1212(4)

2013 - 1301(5) - 1302(10) - 1303(16) - 1304(15) - 1305(12) - 1306(13) - 1307(25) - 1308(11) - 1309(9) - 1310(13) - 1311(16) - 1312(21)

2014 - 1401(20) - 1402(11) - 1403(23) - 1404(10) - 1405(17) - 1406(21) - 1407(35) - 1408(52) - 1409(47) - 1410(18) - 1411(18) - 1412(20)

2015 - 1501(15) - 1502(15) - 1503(36) - 1504(9)

Any replacements are listed further down

[930] **viXra:1504.0121 [pdf]**
*submitted on 2015-04-15 11:13:03*

**Authors:** Th. Guyer

**Comments:** 8 Pages.

The nicest possible ABC Formula in Mathematic.

**Category:** Number Theory

[929] **viXra:1504.0080 [pdf]**
*submitted on 2015-04-09 23:02:36*

**Authors:** Marius Coman

**Comments:** 5 Pages.

In this paper I show that many Smarandache concatenated sequences, well known for the common feature that contain very few terms which are primes (I present here The concatenated square sequence, The concatenated cubic sequence, The sequence of triangular numbers, The symmetric numbers sequence, The antisymmetric numbers sequence, The mirror sequence, The “n concatenated n times” sequence) contain (or conduct to, through basic operations between terms) very many numbers which are cm-integers (c-primes, m-primes, c-composites, m-composites).

**Category:** Number Theory

[928] **viXra:1504.0077 [pdf]**
*submitted on 2015-04-09 12:35:09*

**Authors:** Marius Coman

**Comments:** 57 Pages.

In three of my previous published books, namely “Two hundred conjectures and one hundred and fifty open problems on Fermat pseudoprimes”, “Conjectures on primes and Fermat pseudoprimes, many based on Smarandache function” and “Two hundred and thirteen conjectures on primes”, I showed my passion for conjectures on sequences of integers. In spite the fact that some mathematicians stubbornly understand mathematics as being just the science of solving and proving, my books of conjectures have been well received by many enthusiasts of elementary number theory, which gave me confidence to continue in this direction. Part One of this book brings together papers regarding conjectures on primes, twin primes, squares of primes, semiprimes, different types of pairs or triplets of primes, recurrent sequences, sequences of integers created through concatenation and other sequences of integers related to primes. Part Two of this book brings together several articles which present the notions of c-primes, m-primes, c-composites and m-composites and show some of the applications of these notions in Diophantine analysis. Part Three of this book presents the notions of “mar constants” and “Smarandache mar constants”, useful to highlight the periodicity of some infinite sequences of positive integers (sequences of squares, cubes, triangular numbers, polygonal numbers), respectively in the analysis of Smarandache concatenated sequences. This book of collected papers seeks to expand the knowledge on some well known classes of numbers and also to define new classes of primes or classes of integers directly related to primes.

**Category:** Number Theory

[927] **viXra:1504.0069 [pdf]**
*submitted on 2015-04-09 04:31:36*

**Authors:** Marius Coman

**Comments:** 5 Pages.

In two previous papers I presented the notion of “mar constant” and showed how could highlight the periodicity of some infinite sequences of integers. In this paper I present the notion of “Smarandache mar constant”, useful in Diophantine analysis of Smarandache concatenated sequences.

**Category:** Number Theory

[926] **viXra:1504.0068 [pdf]**
*submitted on 2015-04-08 15:46:18*

**Authors:** Marius Coman

**Comments:** 1 Page.

In a previous paper I defined the notion of “mar constant”, based on the digital root of a number and useful to highlight the periodicity of some infinite sequences of non-null positive integers. In this paper I present two sequences that, in spite the fact that their terms can have only few values for digital root, don’t seem to have a periodicity, in other words don’t seem to be characterized by a mar constant.

**Category:** Number Theory

[925] **viXra:1504.0064 [pdf]**
*submitted on 2015-04-08 13:31:35*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In this paper I present a notion based on the digital root of a number, namely “mar constant”, that highlights the periodicity of some infinite sequences of non-null positive integers (sequences of squares, cubes, triangular numbers, polygonal numbers etc

**Category:** Number Theory

[924] **viXra:1504.0060 [pdf]**
*submitted on 2015-04-08 09:31:39*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In a previous paper I presented a type of numbers which seem to be often m-primes or m-composites (the numbers of the form 1nn...nn1, where n is a digit or a group of digits, repetead by an odd number of times). In this paper I present a type of numbers which seem to be often c-primes or c-composites. These are the numbers of the form 1abc (formed through concatenation, not the product 1*a*b*c), where a, b, c are three primes such that b = a + 6 and c = b + 6.

**Category:** Number Theory

[923] **viXra:1504.0056 [pdf]**
*submitted on 2015-04-08 04:42:08*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In previous papers I presented already few types of numbers which conduct through concatenation often to cm-integers. In this paper I present a type of numbers which seem to be often m-primes or m-composites. These are the numbers of the form 1nn...nn1 (in all of my papers I understand through a number abc the number where a, b, c are digits and through the number a*b*c the product of a, b, c), where n is a digit or a group of digits, repetead by an odd number of times.

**Category:** Number Theory

[922] **viXra:1504.0002 [pdf]**
*submitted on 2015-04-01 02:48:47*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In a previous paper I presented a very interesting characteristic of Poulet numbers, namely the property that, concatenating two of such numbers, is often obtained a semiprime which is either c-prime or m-prime. Because the study of Fermat pseudoprimes is a constant passion for me, I observed that in many cases they have a behaviour which is similar with that of the squares of primes. Therefore, I checked if the property mentioned above applies to these numbers too. Indeed, concatenating two squares of primes, are often obtained semiprimes which are either c-primes, m-primes or cm-primes. Using just the squares of the first 13 primes greater than or equal to 7 are obtained not less then: 6 semiprimes which are c-primes, 31 semiprimes which are m-primes and 15 semiprimes which are cm-primes.

**Category:** Number Theory

[921] **viXra:1503.0267 [pdf]**
*submitted on 2015-03-31 11:18:19*

**Authors:** Marius Coman

**Comments:** 4 Pages.

In this paper I present a very interesting characteristic of Poulet numbers, namely the property that, concatenating two of such numbers, is often obtained a semiprime which is either c-prime or m-prime. Using just the first 13 Poulet numbers are obtained 9 semiprimes which are c-primes, 20 semiprimes which are m-primes and 9 semiprimes which are cm-primes (both c-primes and m-primes).

**Category:** Number Theory

[920] **viXra:1503.0264 [pdf]**
*submitted on 2015-03-31 06:17:57*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper I present two very interesting and easy formulas that conduct often to primes or cm-integers (c-primes, m-primes, cm-primes, c-composites, m-composites, cm-composites).

**Category:** Number Theory

[919] **viXra:1503.0253 [pdf]**
*submitted on 2015-03-30 06:23:08*

**Authors:** Marius Coman

**Comments:** 4 Pages.

In this paper I show that Smarandache concatenated sequences presented here (i.e. The consecutive numbers sequence, The concatenated odd sequence, The concatenated even sequence, The concatenated prime sequence), sequences well known for the common feature that contain very few terms which are primes, per contra, contain very many terms which are c-primes, m-primes, c-reached primes and m-reached primes (notions presented in my previous papers, see “Conjecture that states that any Carmichael number is cm-composite” and “A property of repdigit numbers and the notion of cm-integer”).

**Category:** Number Theory

[918] **viXra:1503.0242 [pdf]**
*submitted on 2015-03-29 10:39:36*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper I want to name generically all the numbers which are either c-primes, m-primes, cm-primes, c-composites, m-composites or cm-composites with the name “cm-integers” and to present what seems to be a special quality of repdigit numbers (it’s about the odd ones) namely that are often cm-integers.

**Category:** Number Theory

[917] **viXra:1503.0234 [pdf]**
*submitted on 2015-03-29 03:33:20*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper I present three conjectures, i.e.: (1) For any prime p greater than or equal to 7 there exist n, a power of 2, such that, concatenating to the left p with n the number resulted is a prime (2) For any odd prime p there exist n, a power of 2, such that, subtracting one from the number resulted concatenating to the right p with n, is obtained a prime (3) For any odd prime p there exist n, a power of 2, such that, adding one to the number resulted concatenating to the right p with n, is obtained a prime.

**Category:** Number Theory

[916] **viXra:1503.0227 [pdf]**
*submitted on 2015-03-28 15:35:18*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In spite the fact that I wrote seven papers on the notions (defined by myself) of c-primes, m-primes, c-composites and m-composites (see in my paper “Conjecture that states that any Carmichael number is a cm-composite” the definitions of all these notions), I haven’t thinking until now to find a connection, beside the one that defines, of course, such an odd composite n, namely that, after few iterative operations on n, is reached a prime p, between the number n and the prime p. This is what I try to do in this paper, and also to give a name to this prime p, namely, say, “reached prime”, and, in order to distinguish, because a number can be same time c-prime and m-prime, respectively c-composite and m-composite, “c-reached prime” or “m-reached prime”.

**Category:** Number Theory

[915] **viXra:1503.0222 [pdf]**
*submitted on 2015-03-28 13:05:45*

**Authors:** Simon Plouffe

**Comments:** 30 Pages. The conference is in french

Conférence pour la journée de Pi à Marseille le 3/14/15.
Conference on Pi Day of 3/14/15 in Marseille

**Category:** Number Theory

[914] **viXra:1503.0219 [pdf]**
*submitted on 2015-03-27 19:39:02*

**Authors:** Sbiis Saibian

**Comments:** 21 Pages.

The goal in this article is to demonstrate that E# is indeed on the order of ω. Formally this means that for every member of FGH_ω there is a function in E# with at least the same growth rate, and that f_w(n) the smallest member of FGH which eventually dominates over all functions within E#.
It will be demonstrated that a certain family of functions of order-type "w" in E# dominates over corresponding members in FGH_w, thus showing that for every function in FGH_w there is a function in E# which grows at least as fast. Then it will be shown how f_w(n) diagonalizes over this family of functions and must eventually dominate every member of this family.

**Category:** Number Theory

[913] **viXra:1503.0217 [pdf]**
*submitted on 2015-03-28 01:40:00*

**Authors:** Prashanth R. Rao

**Comments:** 2 Pages.

n! is defined as the product 1.2.3………n and it popularly represents the number of ways of seating n people on n chairs. We conceptualize another way of describing n! using sequential cuts to an imaginary circle and derive the following well known result

**Category:** Number Theory

[912] **viXra:1503.0216 [pdf]**
*submitted on 2015-03-28 02:39:54*

**Authors:** Marius Coman

**Comments:** 2 Pages.

Observing the sum of the digits of a number of twin primes, I make in this paper the following three conjectures: (1) for any m the lesser term from a pair of twin primes having as the sum of its digits an odd number there exist an infinity of lesser terms n from pairs of twin primes having as the sum of its digits an even number such that m + n + 1 is prime, (2) for any m the lesser term from a pair of twin primes having as the sum of its digits an even number there exist an infinity of lesser terms n from pairs of twin primes having as the sum of its digits an odd number such that m + n + 1 is prime and (3) if a, b, c, d are four distinct terms of the sequence of lesser from a pair of twin primes and a + b + 1 = c + d + 1 = x, then x is a semiprime, product of twin primes.

**Category:** Number Theory

[911] **viXra:1503.0214 [pdf]**
*submitted on 2015-03-27 15:12:46*

**Authors:** Marius Coman

**Comments:** 2 Pages.

I started this paper in ideea to present the recurrence relation defined as follows: the first term, a(0), is 13, then the n-th term is defined as a(n) = a(n–1) + 6 if n is odd and as a(n) = a(n-1) + 24, if n is even. This recurrence formula produce an amount of primes and odd numbers having very few prime factors: the first 150 terms of the sequence produced by this formula are either primes, power of primes or products of two prime factors. But then I discovered easily formulas even more interesting, for instance a(0) = 13, a(n) = a(n–1) + 10 if n is odd and a(n) = a(n-1) + 80, if n is even (which produces 16 primes in first 20 terms!). Because what seems to matter in order to generate primes for such a recurrent defined formula a(0) = 13, a(n) = a(n–1) + x if n is odd and as a(n) = a(n-1) + y, if n is even, is that x + y to be a multiple of 30 (probably the choice of the first term doesn’t matter either but I like the number 13).

**Category:** Number Theory

[910] **viXra:1503.0213 [pdf]**
*submitted on 2015-03-27 11:14:09*

**Authors:** Marius Coman

**Comments:** 1 Page.

In this paper I make a conjecture which states that there exist an infinity of squares of primes that can be written as p + q + 13, where p and q are twin primes, also a conjecture that there exist an infinity of squares of primes that can be written as 3*q - p - 1, where p and q are primes and q = p + 4.

**Category:** Number Theory

[909] **viXra:1503.0209 [pdf]**
*submitted on 2015-03-27 07:30:52*

**Authors:** Jian Ye

**Comments:** 9 Pages.

The Goldbach theorem and the twin prime theorem are homologous.the paper from the prime origin,derived the equations of the twin prime theorem and the Goldbach theorem,and it revealed the equivalence between the Goldbach theorem and the generalized twin prime theorem.

**Category:** Number Theory

[908] **viXra:1503.0208 [pdf]**
*submitted on 2015-03-27 07:37:51*

**Authors:** Marius Coman

**Comments:** 4 Pages.

In this paper I make seven conjectures on the triplets of primes [p, q, r], where q = p + 4 and r = p + 6, conjectures involving primes, squares of primes, c-primes, m-primes, c-composites and m-composites (the last four notions are defined in previous papers, see for instance the paper “Conjecture that states that any Carmichael number is a cm-composite”.

**Category:** Number Theory

[907] **viXra:1503.0207 [pdf]**
*submitted on 2015-03-27 09:13:43*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper I make a conjecture which states that there exist an infinity of squares of primes of the form 6*k - 1 that can be written as a sum of two consecutive primes plus one and also a conjecture that states that the sequence of the partial sums of odd primes contains an infinity of terms which are squares of primes of the form 6*k + 1.

**Category:** Number Theory

[906] **viXra:1503.0161 [pdf]**
*submitted on 2015-03-21 18:13:55*

**Authors:** Prashanth R. Rao

**Comments:** 2 Pages.

Abstract: If N is an odd composite number that can be written as a product of k-primes not necessarily distinct, then we have devised a simple algorithm that would allow us to express N as the sum of exactly k terms all distinct derived using its prime factors.

**Category:** Number Theory

[905] **viXra:1503.0134 [pdf]**
*submitted on 2015-03-16 11:18:29*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In one of my previous paper, “Conjecture that states than any Carmichael number is a cm-composite”, I defined the notions of c-prime, m-prime, cm-prime, c-composite, m-composite and cm-composite. I conjecture that all Poulet numbers but a set of few definable exceptions belong to one of these six sets of numbers.

**Category:** Number Theory

[904] **viXra:1503.0125 [pdf]**
*submitted on 2015-03-16 04:35:07*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper I present a formula, based on squares of primes, which seems to generate a large amount of c-primes and m-primes (I defined the notions of c-primes and m-primes in my previous paper “Conjecture that states that any Carmichael number is a cm-composite”).

**Category:** Number Theory

[903] **viXra:1503.0123 [pdf]**
*submitted on 2015-03-15 12:53:57*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In one of my previous papers I defined chameleonic numbers as the positive composite squarefree integers C not divisible by 2, 3 or 5 having the property that the absolute value of the number P – d + 1 is always a prime or a power of a prime, where d is one of the prime factors of C and P is the product of all prime factors of C but d. In this paper I revise this definition, I introduce the notions of c-chameleonic numbers and m-chameleonic numbers and I show few interesting connections between c-primes and c-chameleonic numbers (I defined the notions of a c-prime in my paper “Conjecture that states that any Carmichael number is a cm-composite”).

**Category:** Number Theory

[902] **viXra:1503.0119 [pdf]**
*submitted on 2015-03-15 05:27:12*

**Authors:** Marius Coman

**Comments:** 4 Pages.

In my previous paper “Conjecture that states that any Carmichael number is a cm-composite” I defined the notions of c-prime, m-prime, cm-prime, odd positive integers that can be either primes either semiprimes having certain properties, and also the notions of c-composite, m-composite, cm-composite, odd positive integers with two or more prime factors having certain properties. In this paper I present a formula based on squares of primes which seems to lead often (I conjecture that always) to primes, c-primes, m-primes, cm-primes or c-composites, m-composites, cm-composites.

**Category:** Number Theory

[901] **viXra:1503.0117 [pdf]**
*submitted on 2015-03-14 13:41:19*

**Authors:** Edigles Guedes

**Comments:** 5 pages.

In present article, we create discrete formulas for first and second Chebyshev functions.

**Category:** Number Theory

[900] **viXra:1503.0114 [pdf]**
*submitted on 2015-03-14 15:29:26*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In two of my previous papers I defined the notions of c-prime respectively m-prime. In this paper I will define the notion of cm-prime and the notions of c-composite, m-composite and cm-composite and I will conjecture that any Carmichael number is a cm-composite.

**Category:** Number Theory

[899] **viXra:1503.0112 [pdf]**
*submitted on 2015-03-14 09:38:18*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In this paper I show how, concatenating to the right the multiples of 3 with the digit 1, obtaining the number m, respectively with the number 11, obtaining the number n, by the simple operation n – m + 1, under the condition that both m and n are primes, is obtained often (I conjecture that always) a prime or a composite r = p(1)*p(2)*..., where p(1), p(2), ... are the prime factors of r, which have the following property: there exist p(k) and p(h), where p(k) is the product of some distinct prime factors of r and p(h) the product of the other distinct prime factors such that the number p(k) + p(h) – 1 is m-prime and I also define a m-prime.

**Category:** Number Theory

[898] **viXra:1503.0110 [pdf]**
*submitted on 2015-03-14 06:42:24*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In this paper I show how, concatenating to the right the squares of primes with the digit 1, are obtained primes or composites n = p(1)*p(2)*...*p(m), where p(1), p(2), ..., p(m) are the prime factors of n, which seems to have often (I conjecture that always) the following property: there exist p(k) and p(h), where p(k) is the product of some distinct prime factors of n and p(h) the product of the other distinct prime factors such that the numbers p(k) + p(h) ± 1 are twin primes or twin c-primes and I also define the notion of a c-prime.

**Category:** Number Theory

[897] **viXra:1503.0094 [pdf]**
*submitted on 2015-03-12 15:05:58*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper I make a conjecture which states that from any prime p of the form 11 + 30*k can be obtained, through a certain formula, an infinity of semiprimes q*r such that r + q = 30*m, where m non-null positive integer.

**Category:** Number Theory

[896] **viXra:1503.0093 [pdf]**
*submitted on 2015-03-12 16:09:51*

**Authors:** Andrea Pignataro

**Comments:** 7 Pages.

The goal of this paper is to demonstrate that there exists a constant, a supposedly
irrational and transcendental number, that relates all consecutive natural numbers n (taken from 1)
when mutually divided as (n+1)/n and n/(n+1).

**Category:** Number Theory

[895] **viXra:1503.0089 [pdf]**
*submitted on 2015-03-12 08:55:11*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper I make a conjecture involving primorials which states that from any odd prime p can be obtained, through a certain formula, an infinity of semiprimes q*r such that r + q - 1 = n*p, where n non-null positive integer.

**Category:** Number Theory

[894] **viXra:1503.0083 [pdf]**
*submitted on 2015-03-11 22:14:41*

**Authors:** Zhang Tianshu

**Comments:** 14 Pages.

First, we get rid of three kinds from A+B=C according to their respective odevity and gcf (A, B, C) =1. After that, expound relations between C and raf (A, B, C) by the symmetric law of odd numbers. Finally, we have proven C ≤ Cε [raf (A, B, C)] 1+ ε in which case A+B=C and gcf (A, B, C) =1.

**Category:** Number Theory

[893] **viXra:1503.0082 [pdf]**
*submitted on 2015-03-12 03:12:47*

**Authors:** Yowan Pradhan

**Comments:** 2 Pages.

By analyzing the recently published paper of Ajay K Prasad on Goldbach’s conjecture, I have obtained the exact solution of his paper.

**Category:** Number Theory

[892] **viXra:1503.0078 [pdf]**
*submitted on 2015-03-11 16:30:15*

**Authors:** Islem Ghaffor

**Comments:** 6 Pages.

It is proved that there is formula for counting
exactly the number of( p; p+2 ) lower than an integer,we use in this formula the arithmetic progressions and the cardinal of the set .

**Category:** Number Theory

[891] **viXra:1503.0069 [pdf]**
*submitted on 2015-03-10 12:11:56*

**Authors:** Islem Ghaffor

**Comments:** 11 Pages.

In this paper we try find formulas for prime numbers like formula for even and odd numbers , by use just arithmetic progressions and operations between sets

**Category:** Number Theory

[890] **viXra:1503.0058 [pdf]**
*submitted on 2015-03-08 18:44:42*

**Authors:** Edigles Guedes

**Comments:** 7 pages.

In present article, we create new integral representations for natural logarithm
function, the Euler-Mascheroni constant, the natural logarithm of Riemann zeta function and the first derivative of Riemann zeta function.

**Category:** Number Theory

[889] **viXra:1503.0028 [pdf]**
*submitted on 2015-03-04 01:48:36*

**Authors:** Marius Coman

**Comments:** 4 Pages.

In one of my previous paper, namely “The mar reduced form of a natural number”, I introduced the notion of mar function, which is, essentially, nothing else than the digital root of a number, and I also presented, in another paper, a sequence based on mar function that abounds in primes. In this paper I present another sequence, based on a relation between a number and the value of its mar reduced form (of course not the intrisic one), sequence that seem also to abound in primes and semiprimes.

**Category:** Number Theory

[888] **viXra:1503.0026 [pdf]**
*submitted on 2015-03-03 16:08:31*

**Authors:** Marius Coman

**Comments:** 8 Pages.

In one of my previous paper, “The mar reduced form of a natural number”, I introduced the notion of mar function, which is, essentially, nothing else than the digital root of a number, but defined as an aritmethical function, on the operations of addition, multiplication etc. in such way that it could be used in various applications (Diophantine equations, divizibility problems and others). In this paper I present two notions, useful in Diophantine analysis of Smarandache concatenated sequences or different classes of numbers (sequences of squares, cubes, triangular numbers, polygonal numbers, Devlali numbers, Demlo numbers etc).

**Category:** Number Theory

[887] **viXra:1503.0025 [pdf]**
*submitted on 2015-03-03 16:49:58*

**Authors:** Marius Coman

**Comments:** 4 Pages.

I introduced, in one of my previous paper, namely “The mar reduced form of a natural number”, the notion of mar function, which is, essentially, nothing else than the digital root of a number, but defined as an aritmethical function, in such way that it could be used in various applications (Diophantine analysis of different types of numbers etc). In this paper I present a sequence based on a relation between a number and the value of its mar reduced form (of course not the intrisic one), sequence that seem to be interesting because many of its terms are primes or ar equal to 1 and very few composites.

**Category:** Number Theory

[886] **viXra:1503.0005 [pdf]**
*submitted on 2015-03-01 07:46:41*

**Authors:** T.Nakashima

**Comments:** 1 Page.

This is the new formula of the mobius function.

**Category:** Number Theory

[885] **viXra:1502.0200 [pdf]**
*submitted on 2015-02-22 12:36:35*

**Authors:** Edigles Guedes

**Comments:** 7 pages.

We prove some estimates for von Mangold function, second Chebyshev function and Riemann’s J function by elementary methods.

**Category:** Number Theory

[884] **viXra:1502.0198 [pdf]**
*submitted on 2015-02-22 14:58:04*

**Authors:** Waldemar Puszkarz

**Comments:** 2 Pages.

We propose a new mathematical constant related to the gaps between consecutive primes obtained by concatenating the digits in the prime gap numbers.

**Category:** Number Theory

[883] **viXra:1502.0197 [pdf]**
*submitted on 2015-02-22 07:53:46*

**Authors:** Rodolfo A. Nieves Rivas

**Comments:** 7 Pages.

In this brief paper we present the necessary and sufficient conditions within the solution of the Erdos-Straus conjecture when (n) takes the values of any twin prime. Then we conclude with a table for its visualization and analysis proving by the Bayes' theorem that the twin primes are infinite.

**Category:** Number Theory

[882] **viXra:1502.0196 [pdf]**
*submitted on 2015-02-22 09:15:59*

**Authors:** Edigles Guedes

**Comments:** 7 pages.

We write three proves for Legendre's conjecture: given an integer, n > 0, there is always one prime number, p, such that n^2 < p < (n + 1)^2, using the prime-counting function, the Bertrand's postulate and the Hardy-Wright's estimate.

**Category:** Number Theory

[881] **viXra:1502.0195 [pdf]**
*submitted on 2015-02-22 06:05:29*

**Authors:** Alexander Fedorov

**Comments:** 37 Pages.

\
heIn this paper is offered and theoretically is based the algorithm
permissive with the lp of small number of arithmetic operations
with arbitrary positive integer(N) to answer a question : is N
composite or prime? The algorithm has a high operational speed
which depends a little on value N ,and is based on The method of
structurization of a set of positive integers (Np)
developed by the author. In limits of a framework of this method
is defined a special set of the structured integers (Ns) in which
it becomes possibility for testing of any structured integers (Sn)
on a membership of a set of composite structured integers (Nsc).
Between by Np and Ns is established one-to-one correspondence :
composite structured integers (Snc) are corresponded to composite
positive integers . Prime structured integers
are corresponded to prime positive integers
Thus for testing arbitrary (N) it is necessary to map it into .
Then we test obtained on a membership of
If Sn is a member of then the output follows
that tested N is also composite.If Sn is not a member of Nsc
then the output follows that tested $N$ is also prime , since if Sn
is not composite then it is prime ,tertiary is not given.

**Category:** Number Theory

[880] **viXra:1502.0140 [pdf]**
*submitted on 2015-02-16 16:09:21*

**Authors:** Edigles Guedes

**Comments:** 5 pages.

I proved two approximations for prime numbers using trigonometric sums.

**Category:** Number Theory

[879] **viXra:1502.0136 [pdf]**
*submitted on 2015-02-16 19:49:22*

**Authors:** Edigles Guedes

**Comments:** 3 pages.

I proved two lower bound for rst Chebyshev function and leave a conjecture on prime numbers.

**Category:** Number Theory

[878] **viXra:1502.0134 [pdf]**
*submitted on 2015-02-16 21:36:07*

**Authors:** Edigles Guedes

**Comments:** 3 pages.

We write a prove for Oppermann's conjecture using the Hardy-Wright's estimate for prime-counting function.

**Category:** Number Theory

[877] **viXra:1502.0131 [pdf]**
*submitted on 2015-02-16 13:02:14*

**Authors:** Edigles Guedes

**Comments:** 7 pages.

I proved some three approximations for prime numbers.

**Category:** Number Theory

[421] **viXra:1503.0119 [pdf]**
*replaced on 2015-03-17 03:05:30*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In my previous paper “Conjecture that states that any Carmichael number is a cm-composite” I defined the notions of c-prime, m-prime and cm-prime, odd positive integers that can be either primes either semiprimes having certain properties, and also the notions of c-composites, m-composites and cm-composites. In this paper I present a formula based on squares of primes which seems to lead often to primes, c-primes, m-primes and cm-primes.

**Category:** Number Theory

[420] **viXra:1503.0114 [pdf]**
*replaced on 2015-03-17 03:00:34*

**Authors:** Marius Coman

**Comments:** 3 Pages.

In two of my previous papers I defined the notions of c-prime respectively m-prime. In this paper I will define the notion of cm-prime and the notions of c-composite, m-composite and cm-composite and I will conjecture that any Carmichael number is a cm-composite.

**Category:** Number Theory

[419] **viXra:1503.0089 [pdf]**
*replaced on 2015-03-12 14:34:56*

**Authors:** Marius Coman

**Comments:** 2 Pages.

In this paper I make a conjecture involving primorials which states that from any odd prime p can be obtained, through a certain formula, an infinity of semiprimes q*r such that r + q - 1 = n*p, where n non-null positive integer.

**Category:** Number Theory

[418] **viXra:1503.0005 [pdf]**
*replaced on 2015-03-04 03:13:20*

**Authors:** T.Nakashima

**Comments:** 2 Pages.

This is the new formula of the mobius function.

**Category:** Number Theory