Generalized Methods to prove the Factorial and Multinomial Theorems for Machine Leaning and Cybersecurity

09 September 2022, Version 12
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

Combinatorial techniques with binomial coefficients, factorials and multinomial computation are used as computing algorithm or cryptographic algorithm for the programs development to apply in artificial intelligence and cybersecurity. Methodological advances in combinatorics and mathematics play a vital role in machine learning and cryptology for data analysis and artificial intelligence-based cybersecurity for protection of the computing systems, devices, networks, programs and data from cyber-attacks. In this article, combinatorial geometric series is discussed more for the application of machine learning and cybersecurity.

Keywords

algorithm
combinatorics
computation
multinomial

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.