Your last test case is accidentally all commented out, so isn't a real test case
The question is unclear. Do the factor-numbers all have to be two-digited?
@Jan-Andrea Bard, no.
Although it is not mentioned clearly in the problem statement but you can see a hint from the test suite
hi, my cod gives me true ans but its worked too slow because of for loop but could not figure it out without for loop. could u send me our code or check mines ? function u = euler004(n)
function L = ispalindrome(n)
if str2double(s(i)) == str2double(s(l-i+1))
can anyone explain what is meaning of products of two inputs ,here input is only one number ,does it mean the square of input
Thanks for the note Aurelien. I added to the test suite.
the largest palindrome made from the product of 9999 is 99977999， not 99000099！
and x=999，y=997799, not 906609.
x=2500, y=6249246, not 6167616
x=100, y=999, not 9009
zd c, 99977999 cannot be written as the product of two numbers less than or equal to 9999.
Size 42 ! wow should be the best solution
Project Euler: Problem 3, Largest prime factor
vectorization in N
Circular Primes (based on Project Euler, problem 35)
04 - Scalar Equations 2
Dimensions of a rectangle
Getting the absolute index from a matrix
Poker Series 07: IsTwoPair
Project Euler: Problem 7, Nth prime
Implement Solitaire cipher for N long deck.
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office