scholarly journals Computing support for testing equal values of the figurative numbers in the Pascal triangle

Author(s):  
Miroslava Mihajlov Carević ◽  
Miloš Ilić ◽  
Milena Petrović ◽  
Nebojša Denić

In this paper we deal with a method for the determination of numbers in a Pascal triangle that are simultaneously triangular, tetrahedral and pentaedroidni. The collected results, obtained by mathematical analysis, were verified by computer. For this purpose, we used the C# programming language as well as the computer laboratory within our University in order to test the results. The results collected by computer confirmed the accuracy of the results obtained by mathematical analysis.

2020 ◽  
Vol 30 (3) ◽  
pp. 28-33 ◽  
Author(s):  
S. A. Pryadko ◽  
A. Yu. Troshin ◽  
V. D. Kozlov ◽  
A. E. Ivanov

The article describes various options for speeding up calculations on computer systems. These features are closely related to the architecture of these complexes. The objective of this paper is to provide necessary information when selecting the capability for the speeding process of solving the computation problem. The main features implemented using the following models are described: programming in systems with shared memory, programming in systems with distributed memory, and programming on graphics accelerators (video cards). The basic concept, principles, advantages, and disadvantages of each of the considered programming models are described. All standards for writing programs described in the article can be used both on Linux and Windows operating systems. The required libraries are available and compatible with the C/C++ programming language. The article concludes with recommendations on the use of a particular technology, depending on the type of task to be solved.


2019 ◽  
Vol 11 (1) ◽  
pp. 43-46
Author(s):  
Zsolt Darvay ◽  
Ágnes Füstös

Abstract In this article we discuss the interior-point algorithm for the general complementarity problems (LCP) introduced by Tibor Illés, Marianna Nagy and Tamás Terlaky. Moreover, we present a various set of numerical results with the help of a code implemented in the C++ programming language. These results support the efficiency of the algorithm for both monotone and sufficient LCPs.


Author(s):  
Jwngsar Moshahary

Intuitionistic or pythagorean fuzzy sets are the best tools to deal with uncertainty or ambiguity to solve diverse disciplines of application problems. It is often difficult to compute union, intersection, and complements when it comes to a large number of members contained in the set, also it is difficult to check whether it is a subset or not. Here, we used the C-programming language to overcome the problems, and then it is found that more effective and realistic results have been obtained.


Sign in / Sign up

Export Citation Format

Share Document