Добірка наукової літератури з теми "Perfect numbers"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Perfect numbers".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Perfect numbers"
Hassler, Uwe. "Perfect Numbers." Euleriana 3, no. 2 (August 22, 2023): 176–85. http://dx.doi.org/10.56031/2693-9908.1052.
Повний текст джерелаAusubel, Ramona. "Perfect Numbers." Ploughshares 50, no. 2 (June 2024): 32–46. http://dx.doi.org/10.1353/plo.2024.a932313.
Повний текст джерелаHoldener, Judy, and Emily Rachfal. "Perfect and Deficient Perfect Numbers." American Mathematical Monthly 126, no. 6 (May 29, 2019): 541–46. http://dx.doi.org/10.1080/00029890.2019.1584515.
Повний текст джерелаFu, Ruiqin, Hai Yang, and Jing Wu. "The Perfect Numbers of Pell Number." Journal of Physics: Conference Series 1237 (June 2019): 022041. http://dx.doi.org/10.1088/1742-6596/1237/2/022041.
Повний текст джерелаPollack, Paul, and Vladimir Shevelev. "On perfect and near-perfect numbers." Journal of Number Theory 132, no. 12 (December 2012): 3037–46. http://dx.doi.org/10.1016/j.jnt.2012.06.008.
Повний текст джерелаHeath-Brown, D. R. "Odd perfect numbers." Mathematical Proceedings of the Cambridge Philosophical Society 115, no. 2 (March 1994): 191–96. http://dx.doi.org/10.1017/s0305004100072030.
Повний текст джерелаKlurman, Oleksiy. "Radical of perfect numbers and perfect numbers among polynomial values." International Journal of Number Theory 12, no. 03 (March 23, 2016): 585–91. http://dx.doi.org/10.1142/s1793042116500378.
Повний текст джерелаTang, Min, Xiao-Zhi Ren, and Meng Li. "On near-perfect and deficient-perfect numbers." Colloquium Mathematicum 133, no. 2 (2013): 221–26. http://dx.doi.org/10.4064/cm133-2-8.
Повний текст джерелаJ. J., Segura, and Ortega S. "All KnownPerfect Numbers other than 6 Satisfy N=4+6n." international journal of mathematics and computer research 12, no. 03 (March 23, 2024): 4103–6. http://dx.doi.org/10.47191/ijmcr/v12i3.04.
Повний текст джерелаJiang, Xing-Wang. "On even perfect numbers." Colloquium Mathematicum 154, no. 1 (2018): 131–36. http://dx.doi.org/10.4064/cm7374-11-2017.
Повний текст джерелаДисертації з теми "Perfect numbers"
Yamada, Tomohiro. "Unitary super perfect numbers." 京都大学 (Kyoto University), 2009. http://hdl.handle.net/2433/124385.
Повний текст джерелаAbu-Arish, Hiba Ibrahim. "Perfect Numbers and Perfect Polynomials: Motivating Concepts From Kindergarten to College." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1461154144.
Повний текст джерелаKolenick, Joseph F. "On exponentially perfect numbers relatively prime to 15 /." Connect to resource online, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1196698780.
Повний текст джерелаKolenick, Joseph F. Jr. "On Exponentially Perfect Numbers Relatively Prime to 15." Youngstown State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1196698780.
Повний текст джерелаSutharzan, Sreeskandarajan. "A GENOME-WIDE ANALYSIS OF PERFECT INVERTED REPEATS IN ARABIDOPSIS THALIANA." Miami University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=miami1386848607.
Повний текст джерелаJanse, Sarah A. "INFERENCE USING BHATTACHARYYA DISTANCE TO MODEL INTERACTION EFFECTS WHEN THE NUMBER OF PREDICTORS FAR EXCEEDS THE SAMPLE SIZE." UKnowledge, 2017. https://uknowledge.uky.edu/statistics_etds/30.
Повний текст джерелаBenchetrit, Yohann. "Propriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAM049/document.
Повний текст джерелаComputing the chromatic number and finding an optimal coloring of a perfect graph can be done efficiently, whereas it is an NP-hard problem in general. Furthermore, testing perfection can be carried- out in polynomial-time. Perfect graphs are characterized by a minimal structure of their sta- ble set polytope: the non-trivial facets are defined by clique-inequalities only. Conversely, does a similar facet-structure for the stable set polytope imply nice combinatorial and algorithmic properties of the graph ? A graph is h-perfect if its stable set polytope is completely de- scribed by non-negativity, clique and odd-circuit inequalities. Statements analogous to the results on perfection are far from being understood for h-perfection, and negative results are missing. For ex- ample, testing h-perfection and determining the chromatic number of an h-perfect graph are unsolved. Besides, no upper bound is known on the gap between the chromatic and clique numbers of an h-perfect graph. Our first main result states that the operations of t-minors keep h- perfection (this is a non-trivial extension of a result of Gerards and Shepherd on t-perfect graphs). We show that it also keeps the Integer Decomposition Property of the stable set polytope, and use this to answer a question of Shepherd on 3-colorable h-perfect graphs in the negative. The study of minimally h-imperfect graphs with respect to t-minors may yield a combinatorial co-NP characterization of h-perfection. We review the currently known examples of such graphs, study their stable set polytope and state several conjectures on their structure. On the other hand, we show that the (weighted) chromatic number of certain h-perfect graphs can be obtained efficiently by rounding-up its fractional relaxation. This is related to conjectures of Goldberg and Seymour on edge-colorings. Finally, we introduce a new parameter on the complexity of the matching polytope and use it to give an efficient and elementary al- gorithm for testing h-perfection in line-graphs
Spa, Carvajal Carlos. "Time-domain numerical methods in room acoustics simulations." Doctoral thesis, Universitat Pompeu Fabra, 2009. http://hdl.handle.net/10803/7565.
Повний текст джерелаEn aquesta Tesi hem centrat el nostre anàlisis en els mètodes basats en el comportament ondulatori dins del domini temporal. Més concretament, estudiem en detall les formulacions més importants del mètode de Diferències Finites, el qual s'utilitza en moltes aplicacions d'acústica de sales, i el recentment proposat mètode PseudoEspectral de Fourier. Ambdós mètodes es basen en la formulació discreta de les equacions analítiques que descriuen els fenòmens acústics en espais tancats.
Aquesta obra contribueix en els aspectes més importants en el càlcul numèric de respostes impulsionals: la propagació del so, la generació de fonts i les condicions de contorn de reactància local.
Room acoustics is the science concerned to study the behavior of sound waves in enclosed rooms. The acoustic information of any room, the so called impulse response, is expressed in terms of the acoustic field as a function of space and time. In general terms, it is nearly impossible to find analytical impulse responses of real rooms. Therefore, in the recent years, the use of computers for solving this type of problems has emerged as a proper alternative to calculate the impulse responses.
In this Thesis we focus on the analysis of the wavebased methods in the timedomain. More concretely, we study in detail the main formulations of FiniteDifference methods, which have been used in many room acoustics applications, and the recently proposed Fourier PseudoSpectral methods. Both methods are based on the discrete formulations of the analytical equations that describe the sound phenomena in enclosed rooms.
This work contributes to the main aspects in the computation of impulse responses: the wave propagation, the source generation and the locallyreacting boundary conditions.
"Algorithms in the study of multiperfect and odd perfect numbers." Thesis, University of Technology, Sydney. Department of Mathematical Sciences, 2003. http://hdl.handle.net/10453/20034.
Повний текст джерелаA long standing unanswered question in number theory concerns the existence (or not) of odd perfect numbers. Over time many properties of an odd perfect number have been established and refined. The initial goal of this research was to improve the lower bound on the number of distinct prime factors of an odd perfect number, if one exists, to at least 9. Previous approaches to this problem involved the analysis of a carefully chosen set of special cases with each then being eliminated by a contradiction. This thesis applies an algorithmic, factor chain approach to the problem. The implementation of such an approach as a computer program allows the speed, accuracy and flexibility of modern computer technology to not only assist but even direct the discovery process. In addition to considering odd perfect numbers, several related problems were investigated, concerned with (i) harmonic, (ii) even multiperfect and (iii) odd triperfect numbers. The aim in these cases was to demonstrate the correctness and versatility of the computer code and to fine tune its efficiency while seeking improved properties of these types of numbers. As a result of this work, significant improvements have been made to the understanding of harmonic numbers. The introduction of harmonic seeds, coupled with a straightforward procedure for generating most harmonic numbers below a chosen bound, expands the opportunities for further investigations of harmonic numbers and in particular allowed the determination of all harmonic numbers below 10 to the power 12 and a proof that there are no odd harmonic numbers below 10 to the power 15. When considering even multiperfect numbers, a search procedure was implemented to find the first 10-perfect number as well as several other new ones. As a fresh alternative to the factor chain search, a 0-1 linear programming model was constructed and used to show that all multiperfect numbers divisible by 2 to the power of a, for a being less than or equal to 65, subject to a modest constraint, are known in the literature. Odd triperfect numbers (if they exist) have properties which are similar to, but simpler than, those for odd perfect numbers. An extended test on the possible prime factors of such a number was developed that, with minor differences, applies to both odd triperfect and odd perfect numbers. When applicable, this test allows an earlier determination of a contradiction within a factor chain and so reduces the effort required. It was also shown that an odd triperfect number must be greater than 10 to the power 128. While the goal of proving that an odd perfect number must have at least 9 distinct prime factors was not achieved, due to mainly practical limitations, the algorithmic approach was able to show that for an odd perfect number with 8 distinct prime factors, (i) if it is exactly divisible by 3 to the power of 2a then a = 1, 2, 3, 5, 6 or a is greater than or equal to 31 (ii) if the special component is pi to the power of alpha, pi less than 10 to the 6 and pi to the (alpha+1) less than 10 to the 40, then alpha = 1.
"Algorithms in the Study of Multiperfect and Odd Perfect Numbers." University of Technology, Sydney. Department of Mathematical Sciences, 2003. http://hdl.handle.net/2100/275.
Повний текст джерелаКниги з теми "Perfect numbers"
R, Jorge Emilio Molina. La tetraléctica de los números perfectos. La Paz, Bolivia: Producciones CIMA, 1999.
Знайти повний текст джерелаRivero, Jorge Emilio Molina. La tetraléctica de los números perfectos. La Paz, Bolivia: Producciones CIMA, 1999.
Знайти повний текст джерелаJulia, Line, ed. The book of love numbers: Use your love number to discover your perfect partner. Wellingborough, Northamptonshire: Aquarian Press, 1986.
Знайти повний текст джерелаCoppa, Max. Does your love life add up?: How to use numbers to find your perfect relationship. New York: Jeremy P. Tarcher/Penguin, 2009.
Знайти повний текст джерелаMoraes, Augusto C. M. Compressible laminar boundary layers for perfect and real gases in equilibrium at Mach numbers to 30. Washington, D. C: American Institute of Aeronautics and Astronautics, 1992.
Знайти повний текст джерелаPerfect, Amicable and Sociable Numbers: A Computational Approach. World Scientific Publishing Co Pte Ltd, 1996.
Знайти повний текст джерелаPerfect, amicable, and sociable numbers: A computational approach. Singapore: World Scientific, 1996.
Знайти повний текст джерелаPerfect, Amicable and Sociable Numbers: A Computational Approach. World Scientific Publishing Co Pte Ltd, 1996.
Знайти повний текст джерелаDeza, Elena. Perfect and Amicable Numbers. World Scientific Publishing Co Pte Ltd, 2022.
Знайти повний текст джерелаCai, Tianxin. Perfect Numbers and Fibonacci Sequences. World Scientific Publishing Co Pte Ltd, 2022.
Знайти повний текст джерелаЧастини книг з теми "Perfect numbers"
Anglin, W. S., and J. Lambek. "Perfect Numbers." In The Heritage of Thales, 37–40. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-0803-7_9.
Повний текст джерелаHunacek, Mark. "Perfect Numbers." In Introduction to Number Theory, 65–70. Boca Raton: Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/9781003318712-5.
Повний текст джерелаRassias, Michael Th. "Perfect numbers, Fermat numbers." In Problem-Solving and Selected Topics in Number Theory, 29–35. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-0495-9_3.
Повний текст джерелаBressoud, David M. "Primes and Perfect Numbers." In Factorization and Primality Testing, 17–29. New York, NY: Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4612-4544-5_2.
Повний текст джерелаSolov’eva, Faina I. "Switchings and Perfect Codes." In Numbers, Information and Complexity, 311–24. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-6048-4_25.
Повний текст джерелаCook, R. "Bounds for odd perfect numbers." In CRM Proceedings and Lecture Notes, 67–71. Providence, Rhode Island: American Mathematical Society, 1999. http://dx.doi.org/10.1090/crmp/019/07.
Повний текст джерелаAllen, G. Donald. "Primes, Perfect Numbers and Magic Numbers (Just for Fun)." In Pedagogy and Content in Middle and High School Mathematics, 25–28. Rotterdam: SensePublishers, 2017. http://dx.doi.org/10.1007/978-94-6351-137-7_7.
Повний текст джерелаSándor, J., and B. Crstici. "Perfect numbers: Old and new issues; perspectives." In Handbook of Number Theory II, 15–96. Dordrecht: Springer Netherlands, 2004. http://dx.doi.org/10.1007/1-4020-2547-5_1.
Повний текст джерелаFord, Kevin, D. R. Heath-Brown, and Sergei Konyagin. "Large Gaps Between Consecutive Prime Numbers Containing Perfect Powers." In Analytic Number Theory, 83–92. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22240-0_5.
Повний текст джерелаBelmonte, Rémy, Pinar Heggernes, Pim van ’t Hof, and Reza Saei. "Ramsey Numbers for Line Graphs and Perfect Graphs." In Lecture Notes in Computer Science, 204–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32241-9_18.
Повний текст джерелаТези доповідей конференцій з теми "Perfect numbers"
Irmak, Nurettin, and Abdullah Açikel. "On perfect numbers close to Tribonacci numbers." In 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL AND RELATED SCIENCES (ICMRS 2018). Author(s), 2018. http://dx.doi.org/10.1063/1.5047878.
Повний текст джерелаSavarimuthu, Sabeenian Royappan, Kalaiselvi Cinnu Muthuraji, and Paramasivam Muthan Eswaran. "Square root for perfect square numbers using Vedic mathematics." In 24TH TOPICAL CONFERENCE ON RADIO-FREQUENCY POWER IN PLASMAS. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0164287.
Повний текст джерелаRathore, Tejmal. "Arranging Integer Numbers on a Loop Such That the Sum of any Two Adjacent Numbers Is a Perfect Square." In 2022 IEEE Region 10 Symposium (TENSYMP). IEEE, 2022. http://dx.doi.org/10.1109/tensymp54529.2022.9864484.
Повний текст джерелаLohmann, A., W. Stork, and G. Stucke. "Optical Implementation of the Perfect Shuffle." In Optical Computing. Washington, D.C.: Optica Publishing Group, 1985. http://dx.doi.org/10.1364/optcomp.1985.wa3.
Повний текст джерелаaus der Wiesche, Stefan, Felix Reinker, Robert Wagner, Leander Hake, and Max Passmann. "Critical and Choking Mach Numbers for Organic Vapor Flows Through Turbine Cascades." In ASME Turbo Expo 2021: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/gt2021-59013.
Повний текст джерелаWan, Lingxiao, Huihui Zhu, Bo Wang, Hui Zhang, Leong Chuan Kwek, and Ai Qun Liu. "A Boson Sampling Chip for Graph Perfect Matching." In CLEO: QELS_Fundamental Science. Washington, D.C.: Optica Publishing Group, 2022. http://dx.doi.org/10.1364/cleo_qels.2022.ff2i.6.
Повний текст джерелаMORAES, AUGUSTO, JOSEPH FLAHERTY, and HENRY NAGAMATSU. "Compressible laminar boundary layers for perfect and real gases in equilibrium at Mach numbers to 30." In 30th Aerospace Sciences Meeting and Exhibit. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1992. http://dx.doi.org/10.2514/6.1992-757.
Повний текст джерелаShade, Gary F., and Bhanu Sood. "The “Perfect Storm” Now Appearing in FA Labs Everywhere." In ISTFA 2011. ASM International, 2011. http://dx.doi.org/10.31399/asm.cp.istfa2011p0446.
Повний текст джерелаWettstein, Hans E. "Quality Key Numbers of Gas Turbine Combined Cycles." In ASME Turbo Expo 2020: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/gt2020-14508.
Повний текст джерелаIgnatenko, Yaroslav, Oleg Bocharov, and Roland May. "Movement of a Sphere on a Flat Wall in Non-Newtonian Shear Flow." In ASME 2017 36th International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/omae2017-61131.
Повний текст джерелаЗвіти організацій з теми "Perfect numbers"
Gates, Allison, Michelle Gates, Shannon Sim, Sarah A. Elliott, Jennifer Pillay, and Lisa Hartling. Creating Efficiencies in the Extraction of Data From Randomized Trials: A Prospective Evaluation of a Machine Learning and Text Mining Tool. Agency for Healthcare Research and Quality (AHRQ), August 2021. http://dx.doi.org/10.23970/ahrqepcmethodscreatingefficiencies.
Повний текст джерелаCheng, Peng, James V. Krogmeier, Mark R. Bell, Joshua Li, and Guangwei Yang. Detection and Classification of Concrete Patches by Integrating GPR and Surface Imaging. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317320.
Повний текст джерелаCheng, Peng, James V. Krogmeier, Mark R. Bell, Joshua Li, and Guangwei Yang. Detection and Classification of Concrete Patches by Integrating GPR and Surface Imaging. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317320.
Повний текст джерелаTang, Jiqin, Gong Zhang, Jinxiao Xing, Ying Yu, and Tao Han. Network Meta-analysis of Heat-clearing and Detoxifying Oral Liquid of Chinese Medicines in Treatment of Children’s Hand-foot-mouth Disease:a protocol for systematic review. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, January 2022. http://dx.doi.org/10.37766/inplasy2022.1.0032.
Повний текст джерелаIsrael, Alvaro, and John Merrill. Production of Seed Stocks for Sustainable Tank Cultivation of the Red Edible Seaweed Porphyra. United States Department of Agriculture, 2006. http://dx.doi.org/10.32747/2006.7696527.bard.
Повний текст джерела