DOCSLIB.ORG

Techsparx Java Tuitions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Techsparx Java Tuitions TechSparxJavaTuitionsTechSparxJavaJava Question Bank TuitionsTechSparxJavaTuitionsTechSp arxJavaTuitionsTechSparxJavaTuitions TechSparxJavaTuitionsTechSparxJavaTechSparx Java Tuitions “Better than a thousand days of diligent study is one day with a Great Teacher” TuitionsTechSparxJavaTuitionsTechSp Java Question Bank (version 5.3) arxJavaTuitionsTechSparxJavaTuitionshttp://techsparx.webs.com/ Saravanan.G TechSparxJavaTuitionsTechSparxJava TuitionsTech SparxJavaTuitionsTechSp arxJavaTuitionsTechSparxJavaTuitions TechSparxJavaTuitionsTechSparxJava TuitionsTechSparxJavaTuitionsTechSp arxJavaTuitionsTechSparxJavaTuitions TechSparxJavaTuitionsTechSparxJava TuitionsTechSparxJavaTuitionsTechSp arxJavaTuitionsTechSparxJavaTuitions TechSparxJavaTuitionsTechSparxJava TuitionsTechSparxJavaTuitionsTechSp Contents Modularization ........................................................................................................................................ 3 Most Simplest ......................................................................................................................................... 4 Decision Making Statements ................................................................................................................... 5 Switch Statement .................................................................................................................................... 6 Looping Constructs .................................................................................................................................. 7 Numbers ................................................................................................................................................. 8 Series .................................................................................................................................................... 11 Patterns ................................................................................................................................................ 12 Strings ................................................................................................................................................... 14 One Dimensional Array .......................................................................................................................... 18 Searching and Sorting ............................................................................................................................ 19 Strings and Arrays.................................................................................................................................. 20 Classes, Objects, Functions and Constructors......................................................................................... 21 Two Dimensional Array.......................................................................................................................... 23 Output Programs ................................................................................................................................... 24 2 TechSparx Java Tuitions - 9880 205065 Modularization Module 1 Java basics Module 2 Most Simplest Module 3 Decision Making Statements Module 4 Switch Statement Looping Constructs Module 5 Numbers Module 6 Series Module 7 Patterns Module 8 Strings Module 9 One Dimensional Array Module 10 Searching and Sorting Module 11 Strings and Arrays Classes, Objects, Functions and Module 12 Constructors Module 13 Exception Handling Module 14 Encapsulation(Access Specifier) Module 15 Scanner class Module 16 Two Dimensional Array Module 17 Output Programs Theoretical -BufferedReader Module 18 -Input and Output Stream -Wrapper class -Math class 3 TechSparx Java Tuitions - 9880 205065 Most Simplest 1. Write a program (WAP) to print “Hello World”. 2. WAP to print your name. 3. WAP to add two numbers and display the given numbers and the sum. 4. WAP to find the difference of two numbers and display the given numbers and the difference. 5. WAP to find the product of two numbers and display the given numbers and the product. 6. WAP to find the quotient of two numbers and display the given numbers and the quotient. 7. WAP to find the remainder of two numbers and display the given numbers and the remainder. 8. WAP to find the sum, difference, product, quotient and remainder of two numbers. 9. WAP to find area of a square. 10. WAP to find area of a rectangle. 11. WAP to find area of a triangle whose sides are given. 12. WAP to find the area of a circle. 13. WAP to convert Fahrenheit to Celsius 14. WAP to convert Celsius to Fahrenheit. 15. WAP to calculate the simple interest. 16. WAP to calculate the compound interest. Important formulas: 1. Fahrenheit = (Celsius * 1.8) + 32 2. Area of square = side * side 3. Area of Rectangle = length * breadth 4. Area of a circle = π * r * r 5. Area of a triangle = √(s(s-a)(s-b)(s-c)) where s = (a + b + c)/3 6. Roots of quadratic equation X = (-b ± √(b2 – 4ac)) / (2a) 7. Simple Interest = (principal * rate * time) / 100 8. Compound Interest = principal * ( (1 + (rate/100))time - 1) 4 TechSparx Java Tuitions - 9880 205065 Decision Making Statements 1. Write a program to find the largest of two given numbers. 2. Write a program to find the smallest of two given numbers. 3. Write a program to find if the given number is an ODD number. 4. Write a program to find if the given number is an ODD or EVEN number. 5. Write a program to find if the given number is DIVISIBLE by 7(seven). 6. Write a program to find the largest of three given numbers. 7. Write a program to find the smallest of three given numbers. 8. Write a program to find the real roots of a quadratic equation. (ax2 + bx + c = 0) 9. Write a program to print the grade based on the marks obtained according to the following table Marks Grade >=80 A 60 to 79 B 50 to 59 C 40 to 49 D <40 E 10. Write a program to print the day of week. (using else if ladder) Example: day = 1 dayOfWeek = “Monday” day = 2 dayOfWeek = “Tuesday” 11. Write a program to print the month of the year. (using else if ladder) Example: month = 1 --> monthOfYear = "January" month = 2 --> monthOfYear = "February" 12. Write a program to check if the given character is a digit or upper case letter or a lower case letter or a special character. 13. Write a program to check if the given character is a vowel. 14. Write a program to check if the given number is a buzz number. (Buzz number: A number which is either divisible by 7 or ends with 7. For Example: 67, 49, 37, 21 etc 5 TechSparx Java Tuitions - 9880 205065 Switch Statement 1. Write a program to input number of week’s day (1-7) and translate to its equivalent name of the day of the week. (Example: 1 to Sunday, 2 to Monday… 7 to Saturday) 2. Write a program to input number of month of the year (1 - 12) and translate to its equivalent name of the month. (Example: 1 to January, 2 to February … 12 to December) 3. Write a program to check if the given character is a vowel. 4. Using a switch statement, write a MENU driven program to find the sum, difference, product quotient and remainder. OR Write a program to simulate a SIMPLE CALCULATOR. 5. Using a switch statement, write a MENU driven program to convert a given temperature from Fahrenheit to Celsius and vice versa. For an incorrect choice, an appropriate error message should be displayed. 6. Using a switch statement, write a MENU driven program to calculate the AREA of square, rectangle, triangle and circle. 6 TechSparx Java Tuitions - 9880 205065 Looping Constructs 1. Write a program to print 5 stars. 2. Write a program to print n natural numbers. 3. Write a program to print all even numbers from 50 to 500 (inclusive of 50 and 500) 7 TechSparx Java Tuitions - 9880 205065 Numbers For Loop 1. Write a program to a. Calculate the nth repunit b. Calculate and display first n repunits. 2. WAP a. Calculate nth mersenne number. b. Calculate and display first n Mersenne number (binary repunits). 3. Write a program to display the divisors/factors of a given number. 4. Write a program to calculate the sum of factors of a given number. 5. Write a program to check if two given numbers are amicable. 6. Write a program to find the a. Factorial of n. b. Double Factorial of n. c. Triple Factorial of n. 7. Write a program to check if the given number is a Perfect square. 8. Write a program to find if the given number is one of the following: a. Perfect Number b. Deficient Number c. Abundant Number 9. Write a program to check if the given number is a Prime Number. 10. Write a program to display all the prime numbers from 1 to n. 11. Write a program to display first 20 prime numbers. 12. Write a program to find the Primorial of the given number. While Loop 13. Write a program to check if the given number is a palindrome. 14. Write a program to check if the given number is an Armstrong/Narcissistic Number. 15. Write a program to convert a binary number to decimal number. 16. Write a program to convert a Decimal Number to Binary. 17. Write a program that accepts a number and checks whether it is an AUTOMORPHIC Number. 18. Write a program to calculate the LCM and HCF/GCD of two given numbers. 19. Write a program to check if the given number is a SPECIAL number. 20. Write a program to print first 10 buzz numbers. 21. Write a program to check if the given number is a MAGIC Number 8 TechSparx Java Tuitions - 9880 205065 Definitions of different kinds of numbers: 1. Armstrong or Narcissistic Number: When the sum of the cubes of each digit in the number is equal to the number itself then
Load more

Recommended publications
  • 4 VI June 2016
    4 VI June 2016 www.ijraset.com Volume 4 Issue VI, June 2016 IC Value: 13.98 ISSN: 2321-9653 International Journal for Research in Applied Science & Engineering Technology (IJRASET) Special Rectangles and Narcissistic Numbers of Order 3 And 4 G.Janaki1, P.Saranya2 1,2Department of Mathematics, Cauvery College for women, Trichy-620018 Abstract— We search for infinitely many rectangles such that x2 y2 3A S 2 k2 SK Narcissistic numbers of order 3 and 4 respectively, in which x, y represents the length and breadth of the rectangle. Also the total number of rectangles satisfying the relation under consideration as well as primitive and non-primitive rectangles are also present. Keywords—Rectangle, Narcissistic numbers of order 3 and 4, primitive,non-primitive. I. INTRODUCTION The older term for number theory is arithmetic, which was superseded as number theory by early twentieth century. The first historical find of an arithmetical nature is a fragment of a table, the broken clay tablet containing a list of Pythagorean triples. Since then the finding continues. For more ideas and interesting facts one can refer [1].In [2] one can get ideas on pairs of rectangles dealing with non-zero integral pairs representing the length and breadth of rectangle. [3,4] has been studied for knowledge on rectangles in connection with perfect squares , Niven numbers and kepriker triples.[5-10] was referred for connections between Special rectangles and polygonal numbers, jarasandha numbers and dhuruva numbers Recently in [11,12] special pythagorean triangles in connections with Narcissistic numbers are obtained. In this communication, we search for infinitely many rectangles such that x2 y2 3A S 2 k2 SK Narcissistic numbers of order 3 and 4 respectively, in which x,y represents the length and breadth of the rectangle.
    [Show full text]
  • Input for Carnival of Math: Number 115, October 2014
    Input for Carnival of Math: Number 115, October 2014 I visited Singapore in 1996 and the people were very kind to me. So I though this might be a little payback for their kindness. Good Luck. David Brooks The “Mathematical Association of America” (http://maanumberaday.blogspot.com/2009/11/115.html ) notes that: 115 = 5 x 23. 115 = 23 x (2 + 3). 115 has a unique representation as a sum of three squares: 3 2 + 5 2 + 9 2 = 115. 115 is the smallest three-digit integer, abc , such that ( abc )/( a*b*c) is prime : 115/5 = 23. STS-115 was a space shuttle mission to the International Space Station flown by the space shuttle Atlantis on Sept. 9, 2006. The “Online Encyclopedia of Integer Sequences” (http://www.oeis.org) notes that 115 is a tridecagonal (or 13-gonal) number. Also, 115 is the number of rooted trees with 8 vertices (or nodes). If you do a search for 115 on the OEIS website you will find out that there are 7,041 integer sequences that contain the number 115. The website “Positive Integers” (http://www.positiveintegers.org/115) notes that 115 is a palindromic and repdigit number when written in base 22 (5522). The website “Number Gossip” (http://www.numbergossip.com) notes that: 115 is the smallest three-digit integer, abc, such that (abc)/(a*b*c) is prime. It also notes that 115 is a composite, deficient, lucky, odd odious and square-free number. The website “Numbers Aplenty” (http://www.numbersaplenty.com/115) notes that: It has 4 divisors, whose sum is σ = 144.
    [Show full text]
  • Maths Secrets of Simpsons Revealed in New Book
    MONDAY 7 OCTOBER 2013 WWW.THEDAY.CO.UK Maths secrets of Simpsons revealed in new book The most successful TV show of all time is written by a team of brilliant ‘mathletes’, says writer Simon Singh, and full of obscure mathematical jokes. Can numbers really be all that funny? MATHEMATICS Nerd hero: The smartest girl in Springfield was created by a team of maths wizards. he world’s most popular cartoon a perfect number, a narcissistic number insist that their love of maths contrib- family has a secret: their lines are and a Mersenne Prime. utes directly to the more obvious humour written by a team of expert mathema- Another of these maths jokes – a black- that has made the show such a hit. Turn- Tticians – former ‘mathletes’ who are board showing 398712 + 436512 = 447212 ing intuitions about comedy into concrete as happy solving differential equa- – sent shivers down Simon Singh’s spine. jokes is like wrestling mathematical tions as crafting jokes. ‘I was so shocked,’ he writes, ‘I almost hunches into proofs and formulas. Comedy Now, science writer Simon Singh has snapped my slide rule.’ The numbers are and maths, says Cohen, are both explora- revealed The Simpsons’ secret math- a fake exception to a famous mathemati- tions into the unknown. ematical formula in a new book*. He cal rule known as Fermat’s Last Theorem. combed through hundreds of episodes One episode from 1990 features a Mathletes and trawled obscure internet forums to teacher making a maths joke to a class of Can maths really be funny? There are many discover that behind the show’s comic brilliant students in which Bart Simpson who will think comparing jokes to equa- exterior lies a hidden core of advanced has been accidentally included.
    [Show full text]
  • On Hardy's Apology Numbers
    ON HARDY’S APOLOGY NUMBERS HENK KOPPELAAR AND PEYMAN NASEHPOUR Abstract. Twelve well known ‘Recreational’ numbers are generalized and classified in three generalized types Hardy, Dudeney, and Wells. A novel proof method to limit the search for the numbers is exemplified for each of the types. Combinatorial operators are defined to ease programming the search. 0. Introduction “Recreational Mathematics” is a broad term that covers many different areas including games, puzzles, magic, art, and more [31]. Some may have the impres- sion that topics discussed in recreational mathematics in general and recreational number theory, in particular, are only for entertainment and may not have an ap- plication in mathematics, engineering, or science. As for the mathematics, even the simplest operation in this paper, i.e. the sum of digits function, has application outside number theory in the domain of combinatorics [13, 26, 27, 28, 34] and in a seemingly unrelated mathematical knowledge domain: topology [21, 23, 15]. Pa- pers about generalizations of the sum of digits function are discussed by Stolarsky [38]. It also is a surprise to see that another topic of this paper, i.e. Armstrong numbers, has applications in “data security” [16]. In number theory, functions are usually non-continuous. This inhibits solving equations, for instance, by application of the contraction mapping principle because the latter is normally for continuous functions. Based on this argument, questions about solving number-theoretic equations ramify to the following: (1) Are there any solutions to an equation? (2) If there are any solutions to an equation, then are finitely many solutions? (3) Can all solutions be found in theory? (4) Can one in practice compute a full list of solutions? arXiv:2008.08187v1 [math.NT] 18 Aug 2020 The main purpose of this paper is to investigate these constructive (or algorith- mic) problems by the fixed points of some special functions of the form f : N N.
    [Show full text]
  • Single Digits
    ...................................single digits ...................................single digits In Praise of Small Numbers MARC CHAMBERLAND Princeton University Press Princeton & Oxford Copyright c 2015 by Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TW press.princeton.edu All Rights Reserved The second epigraph by Paul McCartney on page 111 is taken from The Beatles and is reproduced with permission of Curtis Brown Group Ltd., London on behalf of The Beneficiaries of the Estate of Hunter Davies. Copyright c Hunter Davies 2009. The epigraph on page 170 is taken from Harry Potter and the Half Blood Prince:Copyrightc J.K. Rowling 2005 The epigraphs on page 205 are reprinted wiht the permission of the Free Press, a Division of Simon & Schuster, Inc., from Born on a Blue Day: Inside the Extraordinary Mind of an Austistic Savant by Daniel Tammet. Copyright c 2006 by Daniel Tammet. Originally published in Great Britain in 2006 by Hodder & Stoughton. All rights reserved. Library of Congress Cataloging-in-Publication Data Chamberland, Marc, 1964– Single digits : in praise of small numbers / Marc Chamberland. pages cm Includes bibliographical references and index. ISBN 978-0-691-16114-3 (hardcover : alk. paper) 1. Mathematical analysis. 2. Sequences (Mathematics) 3. Combinatorial analysis. 4. Mathematics–Miscellanea. I. Title. QA300.C4412 2015 510—dc23 2014047680 British Library
    [Show full text]
  • A Study of .Perfect Numbers and Unitary Perfect
    CORE Metadata, citation and similar papers at core.ac.uk Provided by SHAREOK repository A STUDY OF .PERFECT NUMBERS AND UNITARY PERFECT NUMBERS By EDWARD LEE DUBOWSKY /I Bachelor of Science Northwest Missouri State College Maryville, Missouri: 1951 Master of Science Kansas State University Manhattan, Kansas 1954 Submitted to the Faculty of the Graduate College of the Oklahoma State University in partial fulfillment of .the requirements fqr the Degree of DOCTOR OF EDUCATION May, 1972 ,r . I \_J.(,e, .u,,1,; /q7Q D 0 &'ISs ~::>-~ OKLAHOMA STATE UNIVERSITY LIBRARY AUG 10 1973 A STUDY OF PERFECT NUMBERS ·AND UNITARY PERFECT NUMBERS Thesis Approved: OQ LL . ACKNOWLEDGEMENTS I wish to express my sincere gratitude to .Dr. Gerald K. Goff, .who suggested. this topic, for his guidance and invaluable assistance in the preparation of this dissertation. Special thanks.go to the members of. my advisory committee: 0 Dr. John Jewett, Dr. Craig Wood, Dr. Robert Alciatore, and Dr. Vernon Troxel. I wish to thank. Dr. Jeanne Agnew for the excellent training in number theory. that -made possible this .study. I wish tc;, thank Cynthia Wise for her excellent _job in typing this dissertation •. Finally, I wish to express gratitude to my wife, Juanita, .and my children, Sondra and David, for their encouragement and sacrifice made during this study. TABLE OF CONTENTS Chapter Page I. HISTORY AND INTRODUCTION. 1 II. EVEN PERFECT NUMBERS 4 Basic Theorems • • • • • • • • . 8 Some Congruence Relations ••• , , 12 Geometric Numbers ••.••• , , , , • , • . 16 Harmonic ,Mean of the Divisors •. ~ ••• , ••• I: 19 Other Properties •••• 21 Binary Notation. • •••• , ••• , •• , 23 III, ODD PERFECT NUMBERS . " . 27 Basic Structure • , , •• , , , .
    [Show full text]
  • Number Gossip About 10 Years Ago and at first I Uploaded It on My Personal Website [6]
    Number Gossip Tanya Khovanova Department of Mathematics, MIT April 15, 2008 Abstract This article covers my talk at the Gathering for Gardner 2008, with some additions. 1 Introduction My pet project Number Gossip has its own website: http://www.numbergossip.com/, where you can plug in your favorite integer up to 9,999 and learn its properties. A behind-the-scenes program checks your number for 49 regular properties and also checks a database for unique properties I collected. 2 Eight The favorite number of this year’s Gathering is composite, deficient, even, odious, palindromic, powerful, practical and Ulam. It is also very cool as it has the rare properties of being a cake and a narcissistic number, as well as a cube and a Fibonacci number. And it also is a power of two. In addition, eight has the following unique properties: • 8 is the only composite cube in the Fibonacci sequence • 8 is the dimension of the octonions and is the highest possible dimension of a normed division algebra • 8 is the smallest number (except 1) which is equal to the sum of the digits of its cube 3 Properties There are 49 regular properties that I check for: arXiv:0804.2277v1 [math.CO] 14 Apr 2008 abundant evil odious Smith amicable factorial palindrome sociable apocalyptic power Fibonacci palindromic prime square aspiring Google pentagonal square-free automorphic happy perfect tetrahedral cake hungry power of 2 triangular Carmichael lazy caterer powerful twin Catalan lucky practical Ulam composite Mersenne prime undulating compositorial Mersenne prime primorial untouchable cube narcissistic pronic vampire deficient odd repunit weird even 1 I selected regular properties for their importance as well as their funny names, so your favorite number could be lucky and happy at the same time, as is the case for 7.
    [Show full text]
  • INDEX to ANSWERS Issue Page Number Symmetryplus 60 2
    INDEX TO ANSWERS Issue Page number SYMmetryplus 60 2 SYMmetryplus 61 4 SYMmetryplus 62 5 SYMmetryplus 63 8 SYMmetryplus 64 9 SYMmetryplus 65 10 SYMmetryplus 66 13 SYMmetryplus 67 15 SYMmetryplus 68 17 SYMmetryplus 69 21 SYMmetryplus 70 25 SYMmetryplus 71 29 SYMmetryplus 72 33 SYMmetryplus 73 37 SYMmetryplus 74 44 1 ANSWERS FROM ISSUE 60 SOME TRIANGLE NUMBERS – 2 Many thanks to Andrew Palfreyman who found five, not four solutions! 7 7 7 7 7 1 0 5 3 0 0 4 0 6 9 0 3 9 4 6 3 3 3 3 1 Grid A 6 6 1 3 2 6 2 0 1 6 0 0 Grid B CROSSNUMBER Many thanks again to Andrew Palfreyman who pointed out that 1 Down and 8 Across do not give unique answers so there are four possible solutions. 1 2 1 2 1 2 1 2 1 4 4 8 1 4 4 8 1 4 4 8 1 4 4 8 3 3 3 3 3 9 1 9 8 9 1 9 3 9 1 9 8 9 1 9 4 5 4 5 4 5 4 5 2 3 1 0 2 3 1 0 2 3 1 0 2 3 1 0 6 7 6 7 6 7 6 7 1 0 9 8 1 0 9 8 1 0 9 8 1 0 9 8 8 9 8 9 8 9 8 9 3 6 1 0 3 6 1 0 9 6 1 0 9 6 1 0 10 10 10 10 5 3 4 3 5 3 4 3 5 3 4 3 5 3 4 3 TREASURE HUNTS 12, 13 12 This is a rostral column in St Petersburg, Russia.
    [Show full text]
  • The Schnirelmann Density of the Set of Deficient Numbers
    THE SCHNIRELMANN DENSITY OF THE SET OF DEFICIENT NUMBERS A Thesis Presented to the Faculty of California State Polytechnic University, Pomona In Partial Fulfillment Of the Requirements for the Degree Master of Science In Mathematics By Peter Gerralld Banda 2015 SIGNATURE PAGE THESIS: THE SCHNIRELMANN DENSITY OF THE SET OF DEFICIENT NUMBERS AUTHOR: Peter Gerralld Banda DATE SUBMITTED: Summer 2015 Mathematics and Statistics Department Dr. Mitsuo Kobayashi Thesis Committee Chair Mathematics & Statistics Dr. Amber Rosin Mathematics & Statistics Dr. John Rock Mathematics & Statistics ii ACKNOWLEDGMENTS I would like to take a moment to express my sincerest appreciation of my fianc´ee’s never ceasing support without which I would not be here. Over the years our rela­ tionship has proven invaluable and I am sure that there will be many more fruitful years to come. I would like to thank my friends/co-workers/peers who shared the long nights, tears and triumphs that brought my mathematical understanding to what it is today. Without this, graduate school would have been lonely and I prob­ ably would have not pushed on. I would like to thank my teachers and mentors. Their commitment to teaching and passion for mathematics provided me with the incentive to work and succeed in this educational endeavour. Last but not least, I would like to thank my advisor and mentor, Dr. Mitsuo Kobayashi. Thanks to his patience and guidance, I made it this far with my sanity mostly intact. With his expertise in mathematics and programming, he was able to correct the direction of my efforts no matter how far they strayed.
    [Show full text]
  • Various Arithmetic Functions and Their Applications
    University of New Mexico UNM Digital Repository Mathematics and Statistics Faculty and Staff Publications Academic Department Resources 2016 Various Arithmetic Functions and their Applications Florentin Smarandache University of New Mexico, [email protected] Octavian Cira Follow this and additional works at: https://digitalrepository.unm.edu/math_fsp Part of the Algebra Commons, Applied Mathematics Commons, Logic and Foundations Commons, Number Theory Commons, and the Set Theory Commons Recommended Citation Smarandache, Florentin and Octavian Cira. "Various Arithmetic Functions and their Applications." (2016). https://digitalrepository.unm.edu/math_fsp/256 This Book is brought to you for free and open access by the Academic Department Resources at UNM Digital Repository. It has been accepted for inclusion in Mathematics and Statistics Faculty and Staff Publications by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected], [email protected], [email protected]. Octavian Cira Florentin Smarandache Octavian Cira and Florentin Smarandache Various Arithmetic Functions and their Applications Peer reviewers: Nassim Abbas, Youcef Chibani, Bilal Hadjadji and Zayen Azzouz Omar Communicating and Intelligent System Engineering Laboratory, Faculty of Electronics and Computer Science University of Science and Technology Houari Boumediene 32, El Alia, Bab Ezzouar, 16111, Algiers, Algeria Octavian Cira Florentin Smarandache Various Arithmetic Functions and their Applications PONS asbl Bruxelles, 2016 © 2016 Octavian Cira, Florentin Smarandache & Pons. All rights reserved. This book is protected by copyright. No part of this book may be reproduced in any form or by any means, including photocopying or using any information storage and retrieval system without written permission from the copyright owners Pons asbl Quai du Batelage no.
    [Show full text]
  • Arxiv:2106.08994V2 [Math.GM] 1 Aug 2021 Efc Ubr N30b.H Rvdta F2 If That and Proved Properties He Studied BC
    Measuring Abundance with Abundancy Index Kalpok Guha∗ Presidency University, Kolkata Sourangshu Ghosh† Indian Institute of Technology Kharagpur, India Abstract A positive integer n is called perfect if σ(n) = 2n, where σ(n) denote n σ(n) the sum of divisors of . In this paper we study the ratio n . We de- I → I n σ(n) fine the function Abundancy Index : N Q with ( ) = n . Then we study different properties of Abundancy Index and discuss the set of Abundancy Index. Using this function we define a new class of num- bers known as superabundant numbers. Finally we study superabundant numbers and their connection with Riemann Hypothesis. 1 Introduction Definition 1.1. A positive integer n is called perfect if σ(n)=2n, where σ(n) denote the sum of divisors of n. The first few perfect numbers are 6, 28, 496, 8128, ... (OEIS A000396), This is a well studied topic in number theory. Euclid studied properties and nature of perfect numbers in 300 BC. He proved that if 2p −1 is a prime, then 2p−1(2p −1) is an even perfect number(Elements, Prop. IX.36). Later mathematicians have arXiv:2106.08994v2 [math.GM] 1 Aug 2021 spent years to study the properties of perfect numbers. But still many questions about perfect numbers remain unsolved. Two famous conjectures related to perfect numbers are 1. There exist infinitely many perfect numbers. Euler [1] proved that a num- ber is an even perfect numbers iff it can be written as 2p−1(2p − 1) and 2p − 1 is also a prime number.
    [Show full text]
  • Arxiv:2008.10398V1 [Math.NT] 24 Aug 2020 Children He Has
    JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000{000 S 0894-0347(XX)0000-0 RECURSIVELY ABUNDANT AND RECURSIVELY PERFECT NUMBERS THOMAS FINK London Institute for Mathematical Sciences, 35a South St, London W1K 2XF, UK Centre National de la Recherche Scientifique, Paris, France The divisor function σ(n) sums the divisors of n. We call n abundant when σ(n) − n > n and perfect when σ(n) − n = n. I recently introduced the recursive divisor function a(n), the recursive analog of the divisor function. It measures the extent to which a number is highly divisible into parts, such that the parts are highly divisible into subparts, so on. Just as the divisor function motivates the abundant and perfect numbers, the recursive divisor function motivates their recursive analogs, which I introduce here. A number is recursively abundant, or ample, if a(n) > n and recursively perfect, or pristine, if a(n) = n. There are striking parallels between abundant and perfect numbers and their recursive counterparts. The product of two ample numbers is ample, and ample numbers are either abundant or odd perfect numbers. Odd ample numbers exist but are rare, and I conjecture that there are such numbers not divisible by the first k primes|which is known to be true for the abundant numbers. There are infinitely many pristine numbers, but that they cannot be odd, apart from 1. Pristine numbers are the product of a power of two and odd prime solutions to certain Diophantine equations, reminiscent of how perfect numbers are the product of a power of two and a Mersenne prime.
    [Show full text]