How do I code this problem?

Question

1.00/5 (1 vote)

See more:

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Write a function that is called this way:
>> n = palin_product(dig,lim);
The function returns the largest palindrome smaller than lim that is the product of two dig digit numbers. If no such number exists, the function returns 0.

What I have tried:

MAths involved -
if 3 is entered as dig then 999*999 we can get the lim.Palindrome can be found out by converting number to string and then check if the string is equal to its reverse. I am stuck on how to check that the number is a product of 2 numbers.

Posted 9-Dec-16 0:46am

Member 12895794

Updated 9-Dec-16 1:14am

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Answer 1 · 2016-12-09T01:14:00

Solution 1

See here: How to Factor a Number: 11 Steps (with Pictures) - wikiHow[^]

Posted 9-Dec-16 1:14am

OriginalGriff

Comments

Member 12895794 9-Dec-16 8:03am

I know how to factor a number. I don't know how to check in code.

OriginalGriff 9-Dec-16 8:21am

If you know how to factor on paper, then you can apply the same algorithm in code.
Give it a try! It's probably a lot easier than you think.

Member 12895794 9-Dec-16 8:55am

the rest of my thinking is correct?

OriginalGriff 9-Dec-16 9:17am

:laugh:
How would I know? I can't read your mind, and you haven't told us the rest of your thinking!
The string technique for palindromes has the advantage of being easy to do, if not particularly efficient. OK for one-offs, but a big drain on resources if you want to check a lot of numbers. You could do it with modulus and divide to reverse the number. Once reversed, if the two integers are the same it's a palindrome.

Member 12895794 9-Dec-16 9:24am

Thanx for your help Man! :)

OriginalGriff 9-Dec-16 9:27am

You're welcome!