
handle: 10525/7255
We investigate cubic intersections by moving plane, which depends on three parameters. For this we prove the main theorem and find the area function (Theorem 2). We show that the area function is a smooth function and differentiable once only. In many special cases this function has at least two points of maximum and four inflection points. For this purpose we also use computer-based methods. We recommend some special cases that can be used in school mathematics. In this way one can integrate together plane geometry, solid geometry, algebra, analysis and computer science.
moving plane, computer-based methods, подвижна равнина, компютърно базирани методи, cubic intersections, сеченията на куб
moving plane, computer-based methods, подвижна равнина, компютърно базирани методи, cubic intersections, сеченията на куб
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
