flâneur

CS106B Perfect numbers

web.stanford.edu · 3,943 words · saved by 1 readers

This warmup task gives you practice with C++ expressions, control structures, and functions, as well as testing and debugging your code. Throughout the writeup, we pose thought questions (in the highlighted yellow boxes) for you to answer. The starter project includes the file short_answer.txt (located under "Other Files" in the Qt Project pane). Edit this file to fill in your responses and submit it with your code. Your section leader will review your responses as part of grading. We'll be evaluating the sincerity and thoughtfulness of your reflection and reasoning; not a rigid "right/wrong" thing. This exercise explores a type of numbers called perfect numbers. Before we jump into the coding, let's begin with a little math and history. A perfect number is an integer that is equal to the sum of its proper divisors. A number's proper divisors are those positive numbers that evenly divide it, excluding itself. The first perfect number is 6 because its proper divisors are 1, 2, and 3, an

CS106B Perfect numbers Perfect numbers Assignment written by Julie Zelenski This warmup task gives you practice with C++ expressions, control structures, and functions, as well as testing and debugging your code. Throughout the writeup, we pose thought questions (in the highlighted yellow boxes) for you to answer. The starter project includes the file short_answer . txt (located under "Other Files" in the Qt Project pane). Edit this file to fill in your responses and submit it with your code. Your section leader will review your responses as part of grading. We'll be evaluating the sincerity a

related reading