Given a positive integer, n, return a, b, c and d, such that
1. n = a*sqrt(b)+c*sqrt(d)
2. a, b, c and d are all positive integers greater than 1
If a solution does not exist, set all four output variables to zero.
Example 1:
n = 41
a = 5
b = 16
c = 7
d = 9
Example 2:
n = 6
a = 0
b = 0
c = 0
d = 0
Solution Stats
Solution Comments
Recent Solvers11
Suggested Problems
-
Sum all integers from 1 to 2^n
6022 Solvers
-
269 Solvers
-
Compute a dot product of two vectors x and y
632 Solvers
-
539 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
121 Solvers
More from this Author34
Tags
Select a Web Site
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: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Solution 882238
Heh...a 24 point increase in Cody Size is what I get for doing the loops efficiently. :-)