Counting Palindromes with a Certain Ending & an Announcement

Hello. With this small program comes a large, important update. I shall talk about it right after going over this small program.

The Program

In relations to the prior post about a program finding the next program. I have been tasked to make a program where it must find how many palindromes with a certain length exist with a certain ending. It turned out to be an easy task and I was able to code up the program in an afternoon. You can find it here on github.

The programs simply requests from the user a number to serve as the ending of a palindrome and a number serving as the length of the numbers being looked at. After getting two valid integers for both, by making sure they are positive integers, the program then does the following equation:

z = roundup(length of numbers being looked at / 2) - length of first inputted number

If z is greater than or equal to 0, the program will return 10^z . Otherwise, it will return 0.

For instance, let's find the amount of palindromes with a length of 5 digits and ending with 84. Inputting these numbers into the equation gives this:

z = roundup(5/2) - (2)  → z = 1

10 to the power of z will just be ten. This is true as there at 10 palindromes with 5 digits and ending with 84: 48084, 48184, 48284, 48384, 48484, 48584, 48684, 48784, 48884, and 48984. If there are no palindromes possible such as asking for a palindrome with 2 digits ending with 123, it will return 0. The program should work for all positive integers. 

The Announcement

So, I have been doing some coding projects for a while now. Some easy, some mildly complex. I've wanted to do more explanations on these than the simple posts I do on this website.

I've considered doing videos on the creation of these programs. This will be my first videos I've done in a while, as before I've attempted to do let's play videos and livestreams some years ago. The videos will not be simple tutorials, but instead more like guides on GeeksForGeeks, though it's been some months since I used GFG.  When I make a video on one of my programs, I'll start by explaining how the program works step by step. After that, I'll get into coding the program line by line.

When will I make one of these videos? Hopefully, I will make my first video soon. This is my channel which I will be using. Keep tuned for any new videos. See you next time.

Comments

Post a Comment

Popular posts from this blog

Version 2:The Not-So Barebones Clicker

Image
I was originally going to make this post tomorrow, but due to events I am doing it today when I can. As seen, I have updated the Barebones Clicker to become a Not-So Barebones Clicker. This is now more than just a button and a counter. As you can see, one of the big changes was generators. There are currently three of them. These are not really made to be fair though, as I'm pretty sure some are way more efficiant than others, but I wasn't really concerned with that.An interesting part about the generators is that if you try to buy them and you don't got the money, a message will appear for a few seconds telling you that you can't afford it. Another big change included was the save. This is not a good save, as it just relies on cookies. Yet, you can refesh the page, and the numbers will still be there (given that one saves and loads). This took hours to code, specifically to make functional. I went to Dhmstark again along with stackexchange for coding help. S
Read more

A Prime Factorization Algorithm that Uses a Text File

Image
A post that is at least within two week of the last one? This will hopefully be the new norm. I was about to get this out two days prior, but Github had some issues when I was about to upload it on the first day. I got this uploaded to Github the yesterday, but it was late, so I didn't make a post. Nevertheless, it's time to talk about this code. I have created a python program that shall do prime factorization when given an integer. You can find it here on Github .  The Background So this is another program requested by my computer science teacher. He demanded a program that would be given a number and return the prime factors of it along with how many times each was used (and specifically in the order you see in the program's output). Initially, I though this was an easy program. There's a rule I've known since middle school on how to prime factorize: Start by dividing the number by 2 for as many times possible When you can no longer divide by 2, div
Read more

Aesthetico Ultimate Designer - A Python Turtle Program

Image
In the last post on my previous work, I tried to use a program I made in my Python class. It used the Turtle module to make lines. However, it seems that I forgot to save the code for that (and I didn't have a Repl account back then). So I just put something else up instead.  Over December, I've tried to remake that program I once made before on REPL . This is the best thing I could recreate, since I did not have anything to build upon other than the memory of it.  It's a simple program. It will ask which direction and degree the line should turn to. It then asks what type of line to make, and then it creates the line. You can continue on and create more lines, or simply end it.  I tried to keep up this somewhat professional and Aesthetic look back when I first made it long ago. I used colours from an Aesthetic colour pallet, and I had every word between dashes. I will say, it somewhat looks cool.   I will say, however, that this remake is not as good a
Read more