No abstract

The goal of the presented paper is to compare the different approaches of the Novartis Global IT project management in its four divisions. The basics of the project management with the focus on the global or international project management are described in the theoretical part. There are highlighted the ways of projects´ monitoring and evaluation. The history and the evolution of the project management in the context of used methods and approaches in various time periods in the particular divisions of the Novartis Global group are described in the analytical part. The comparison is used through the identification of positives and negatives of the analysed IT project management parameters. Currently we underline the importance of the communication within and outside of the projects with emphasis on the cultural differences in global project management. The results of the comparison are becoming essential for the recommendation for future project management plans in the Novartis Global group. JEL Classification Numbers: M21, O32, O5,

The transition from arithmetic to algebra requires students to change both their thinking and the way they learn. We often observe students using arithmetic formalism also when solving algebraic problems. This formalism manifests itself primarily in the acquisition of coherent computational procedures. Students must be sufficiently aware that the computation steps are sequential transformations of the problem. This creates a problem for them in solving more complex problems. Our research investigated whether problem transformation coupled with atomization is a suitable alternative for students to learn coherent algorithms. Although atomization is not based on precise rules, it was reported by students to be a comprehensible way of solving problems and providing them with sufficient confidence. If students are motivated to understand a computational method, this understanding represents fulfilling the student’s need for security.

No abstract

Skewes’ number was discovered in 1933 by South African mathematician Stanley Skewes as upper bound for the first sign change of the difference π (x) − li(x). Whether a Skewes’ number is an integer is an open problem of Number Theory. Assuming Schanuel’s conjecture, it can be shown that Skewes’ number is transcendental. In our paper we have chosen a different approach to prove Skewes’ number is an integer, using lattice points and tangent line. In the paper we acquaint the reader also with prime numbers and their use in RSA coding, we present the primary algorithms Lehmann test and Rabin-Miller test for determining the prime numbers, we introduce the Prime Number Theorem and define the prime-counting function and logarithmic integral function and show their relation.