PL
 |
EN
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 7

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  divisibility
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Some Remarkable Identities Involving Numbers
100%
Ziobro R.
Formalized Mathematics
|
2014
|
tom 22
|
nr 3
205-208
EN
The article focuses on simple identities found for binomials, their divisibility, and basic inequalities. A general formula allowing factorization of the sum of like powers is introduced and used to prove elementary theorems for natural numbers. Formulas for short multiplication are sometimes referred in English or French as remarkable identities. The same formulas could be found in works concerning polynomial factorization, where there exists no single term for various identities. Their usability is not questionable, and they have been successfully utilized since for ages. For example, in his books published in 1731 (p. 385), Edward Hatton [3] wrote: “Note, that the differences of any two like powers of two quantities, will always be divided by the difference of the quantities without any remainer...”. Despite of its conceptual simplicity, the problem of factorization of sums/differences of two like powers could still be analyzed [7], giving new and possibly interesting results [6].
2
Content available Divisibility in β N and *N
100%
Šobot B.
Reports on Mathematical Logic
|
2019
|
tom Vol. 54
65--82
EN
The paper first covers several properties of the extension of the divisibility relation to a set ∗ N of nonstandard integers, including an analogue of the basic theorem of arithmetic. After that, a connection is established with the divisibility in the Stone-Čech compactification βN, proving that the divisibility of ultrafilters introduced by the author is equivalent to divisibility of some elements belonging to their respective monads in an enlargement. Some earlier results on ultrafilters on lower levels on the divisibility hierarchy are illuminated by nonstandard methods. Using limits by ultrafilters we obtain results on ultrafilters above these finite levels, showing that for them a distribution by levels is not possible.
3
Content available remote Divisibility in the Stone-Čech compactification
100%
Šobot B.
Reports on Mathematical Logic
|
2015
|
tom Vol. 50
53--66
EN
After defining continuous extensions of binary relations on the set N of natural numbers to its Stone-Čech compactification βN, we establish some results about one of such extensions. This provides us with one possible divisibility relation on βN, │~, and we introduce a few more, defined in a natural way. For some of them we find equivalent conditions for divisibility. Finally, we mention a few facts about prime and irreducible elements of (βN, ·). The motivation behind all this is to try to translate problems in elementary number theory into βN.
4
Content available Criteria for of the existence of uniquely partitionable graphs with respect to additive induced-hereditary properties
100%
Broere I. , Bucko J. , Mihók P.
Discussiones Mathematicae Graph Theory
|
2002
|
tom 22
|
nr 1
31-37
EN
Let 𝓟₁,𝓟₂,...,𝓟ₙ be graph properties, a graph G is said to be uniquely (𝓟₁,𝓟₂, ...,𝓟ₙ)-partitionable if there is exactly one (unordered) partition {V₁,V₂,...,Vₙ} of V(G) such that $G[V_i] ∈ 𝓟_i$ for i = 1,2,...,n. We prove that for additive and induced-hereditary properties uniquely (𝓟₁,𝓟₂,...,𝓟ₙ)-partitionable graphs exist if and only if $𝓟_i$ and $𝓟_j$ are either coprime or equal irreducible properties of graphs for every i ≠ j, i,j ∈ {1,2,...,n}.
5
Content available Mathematical induction in proving of theorems about natural numbers divisibility
63%
Żywuszko K. , Czajkowski A. A.
Problemy Nauk Stosowanych
|
2013
|
tom T. 1
101--116
EN
Introduction and aims: This paper presents the concept of the division of mathematical expressions with natural variable related to the problem of divisibility. The paper shows some proofs of selected problem. The main aim of this paper is to show a few proofs of theorems about divisibility of expressions by using the method of mathematical induction. Material and methods: In this paper have been solved examples from different sources. Considered problems contain: only polynomials, the sum of powers of different bases (and constant as a component), the sum of the products of powers with different bases (and constant as a component), the sum of the powers and polynomials, the sum of the products of powers and polynomials, the sum containing the power of (-1), Fibonacci sequence, the expression containing a power of the power and problems containing power in divider. In the paper has been used the method of mathematical induction. Results: It has been shown 16 proofs of problems by using mathematical induction. In some examples have been used the additional lemmas which complete the main proof. Conclusion: Using some properties of divisibility theorems and the theorem about mathematical induction allow to show proofs which refer to the divisibility by natural number of various mathematical expressions with natural variable n.
PL
Wstęp i cele: W pracy przedstawiono koncepcję podziału wyrażeń matematycznych ze zmienną naturalną odnoszących się do problemu podzielności a także przedstawiono dowody wybranych zadań. Głównym celem pracy jest pokazanie sposobu dowodzenia twierdzeń o podzielności wyrażeń przy zastosowaniu metody indukcji matematycznej. Materiał i metody: W pracy rozwiązano przykłady z różnych źródeł. Rozważono zadania zawierające: tylko wielomiany, sumy potęg o różnych podstawach (i stałą w roli składnika), sumy iloczynów potęg o różnych podstawach (i stałą w roli składnika), sumy potęg i wielomianów, sumy iloczynów potęg i wielomianów, sumy zawierające potęgę (-1), ciąg Fibonacciego, wyrażenia zawierające potęgę potęgi oraz zadania zawierające potęgę w dzielniku. Zastosowano metodę indukcji matematycznej. Wyniki: Przeprowadzono dowody 16 przykładów przy użyciu indukcji matematycznej. W niektórych przykładach zastosowano dodatkowo dowody lematów, które uzupełniają całość dowodu głównego. Wniosek: Korzystanie z pewnych właściwości twierdzeń o podzielności i twierdzenia o indukcji matematycznej pozwala pokazać dowody, które odnoszą się do podzielności przez liczby naturalne różnych wyrażeń matematycznych ze zmienną naturalną.
6
Content available remote Divisibility of orders of K2 groups associated to quadratic fields
63%
Kimura I.
Demonstratio Mathematica
|
2006
|
tom Vol. 39, nr 2
277-284
EN
We discuss some divisibility results of orders of K-groups and cohomology groups associated to quadratic fields.
7
Content available Divisibility of the second-order minors of the nominators by minimal denominators of transfer matrices of cyclic fractional linear systems
51%
Kaczorek T.
International Journal of Applied Mathematics and Computer Science
|
2021
|
tom Vol. 31, no. 4
627--633
EN
The divisibility of the second-order minors of the numerators of transfer matrices by their minimal denominators for cyclic fractional linear systems is analyzed. It is shown that all nonzero second-order minors of the numerators of the transfer matrices are divisible by their minimal denominators if and only if the system matrices of fractional standard and descriptor linear systems are cyclic. The theorems are illustrated by examples of fractional standard and descriptor linear systems.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.