Search results for "Prime number"
showing 6 items of 26 documents
On the number of different prime divisors of element orders
2005
We prove that the number of different prime divisors of the order of a finite group is bounded by a polynomial function of the maximum of the number of different prime divisors of the element orders. This improves a result of J. Zhang.
ON A QUESTION OF BEIDLEMAN AND ROBINSON
2002
[EN] In [J. C. Beidleman, D. J. S. Robinson, J. Algebra 1997, 191, 686--703, Theorem A], Beidleman and Robinson proved that if a group satisfies the permutizer condition, it is soluble, its chief factors have order a prime number or 4 and G induces the full group of automorphisms in the chief factors of order 4. In this paper, we show that the converse of this theorem is false by showing some counterexamples. We also find some sufficient conditions for a group satisfying the converse of that theorem to satisfy the permutizer condition.
Characters of 𝑝’-degree with cyclotomic field of values
2006
If p p is a prime number and G G is a finite group, we show that G G has an irreducible complex character of degree not divisible by p p with values in the cyclotomic field Q p \mathbb {Q}_p .
Mining Maximal Frequent Patterns in Transactional Databases and Dynamic Data Streams: A Spark-based Approach
2018
Mining maximal frequent patterns (MFPs) in transactional databases (TDBs) and dynamic data streams (DDSs) is substantially important for business intelligence. MFPs, as the smallest set of patterns, help to reveal customers’ purchase rules and market basket analysis (MBA). Although, numerous studies have been carried out in this area, most of them extend the main-memory based Apriori or FP-growth algorithms. Therefore, these approaches are not only unscalable but also lack parallelism. Consequently, ever increasing big data sources requirements cannot be met. In addition, mining performance in some existing approaches degrade drastically due to the presence of null transactions. We, therefo…
Sieve of Eratosthenes to find new numbers
2012
Why is Math so hard for some children? We want to start from the vision and the teorethical dissertation, supported by educational and philosophical theories that here are presented, to use the concept of reification. A new element in contemporary reason is therefore the re-emergence of the subject, the reconsideration of the distinction between objective and subjective, between that which belongs to the subject and that which belongs to the object. We want to submit an experience of study with 10-year old children, at primary school. The aim is to help children in forming the abstract concept of prime numbers and to use this concept for build other concepts.