10 resultados para Prime numbers

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

70.00% 70.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 11D75, 11D85, 11L20, 11N05, 11N35, 11N36, 11P05, 11P32, 11P55.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

Riemann’s memoir is devoted to the function π(x) defined as the number of prime numbers less or equal to the real and positive number x. This is really the fact, but the “main role” in it is played by the already mentioned zeta-function.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This work was presented in part at the 8th International Conference on Finite Fields and Applications Fq^8 , Melbourne, Australia, 9-13 July, 2007.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article provides necessary and sufficient conditions for both of the Diophantine equations X^2 − DY^2 = m1 and x^2 − Dy^2 = m2 to have primitive solutions when m1 , m2 ∈ Z, and D ∈ N is not a perfect square. This is given in terms of the ideal theory of the underlying real quadratic order Z[√D].

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let a1 , . . . , ar, be positive integers, i=1 ... r, m = ∑(ai − 1) + 1 and p = max{a1 , . . . , ar }. For a graph G the symbol G → (a1 , . . . , ar ) means that in every r-coloring of the vertices of G there exists a monochromatic ai -clique of color i for some i ∈ {1, . . . , r}. In this paper we consider the vertex Folkman numbers F (a1 , . . . , ar ; m − 1) = min |V (G)| : G → (a1 , . . . , ar ) and Km−1 ⊂ G} We prove that F (a1 , . . . , ar ; m − 1) = m + 6, if p = 3 and m ≧ 6 (Theorem 3) and F (a1 , . . . , ar ; m − 1) = m + 7, if p = 4 and m ≧ 6 (Theorem 4).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

There are four resolvable Steiner triple systems on fifteen elements. Some generalizations of these systems are presented here.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The result of the distributed computing projectWieferich@Home is presented: the binary periodic numbers of bit pseudo-length j ≤ 3500 obtained by replication of a bit string of bit pseudo-length k ≤ 24 and increased by one are Wieferich primes only for the cases of 1092 or 3510.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 20D60,20E15.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 05C55.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary: 11D09, 11A55, 11C08, 11R11, 11R29; Secondary: 11R65, 11S40; 11R09.