Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SDSS Computing Studies Python Assignment

Assignment #104 Algorithms

There are many problems are solved simply by repetition or using math. These may require the use of while loops, for loops, or cycling through lists multiple times to solve the problem.

Problem 1

NEXT!

Problem 2

Necklace Sequence Necklace numbers are a number sequence. You start with 2 digits. The 3rd digit is created by adding the previous 2 digits, but if it's greater than 10, you add the sum of those 2 digits again. You keep repeating this process until you get back to the 2 digits you started with extra: What is the shortest necklace number sequence that can be made?

Problem 3

Convert to binary

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages