<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
  <channel>
    <title>'Whole number square roots only?' Thread RSS Feed</title>
    <link>http://www.programmersheaven.com/</link>
    <description>Contains the latest posts from the thread 'Whole number square roots only?' posted on the 'Beginner C/C++' forum at Programmer's Heaven.</description>
    <language>en</language>
    <copyright>Copyright 2013 Programmers Heaven</copyright>
    <pubDate>Sat, 25 May 2013 17:43:50 -0700</pubDate>
    <lastBuildDate>Sat, 25 May 2013 17:43:50 -0700</lastBuildDate>
    <generator>Argotic Syndication Framework 2007.3.0.1, http://www.codeplex.com/Argotic</generator>
    <docs>http://www.rssboard.org/rss-specification</docs>
    <ttl>360</ttl>
    <image>
      <url>http://www.programmersheaven.com/images/ph.gif</url>
      <title>Programmers Heaven</title>
      <link>http://www.programmersheaven.com/</link>
      <width>88</width>
      <height>31</height>
    </image>
    <item>
      <title>Whole number square roots only?</title>
      <link>http://www.programmersheaven.com/mb/beginnercpp/431450/431450/whole-number-square-roots-only/</link>
      <description>I need to write a program that will list the fibonacci sequence up until a million (This part is done) and then out of the numbers, I need to take the square roots, and only print the ones that return whole numbers, if I take the square roots of each number (being int's, It will return all the answers rounded to the nearest whole number, which is not what I need. Since I don't even know where to begin on this, I have no code implementing the square root portion. Not asking for it to be done for me , just where do I start maybe? Thanks&lt;br /&gt;
&lt;br /&gt;
Language - C&lt;br /&gt;
&lt;br /&gt;
#include &amp;lt;stdio.h&amp;gt;&lt;br /&gt;
#include &amp;lt;math.h&amp;gt;&lt;br /&gt;
int main(void)&lt;br /&gt;
{&lt;br /&gt;
&lt;br /&gt;
int x, y, z,c,s;&lt;br /&gt;
double d;&lt;br /&gt;
&lt;br /&gt;
x=1; /*Initiating the first values of the fibonacci sequence*/&lt;br /&gt;
y=1;&lt;br /&gt;
z=0;&lt;br /&gt;
c=1; /*Initiating the first value for the count*/&lt;br /&gt;
&lt;br /&gt;
printf("%d\n", x); /*The first two values of the sequence are printed here*/&lt;br /&gt;
printf("%d\n", y);&lt;br /&gt;
	while (z&amp;lt;1000000)&lt;br /&gt;
		{&lt;br /&gt;
		z=x+y; &lt;br /&gt;
		x=y;&lt;br /&gt;
		y=z;&lt;br /&gt;
	c++;&lt;br /&gt;
		&lt;br /&gt;
		if (z&amp;lt;1000000)&lt;br /&gt;
		printf("%d\n", z);&lt;br /&gt;
		&lt;br /&gt;
		}&lt;br /&gt;
printf("The amount of numbers in the follwing sequence is %d\n", c);&lt;br /&gt;
&lt;br /&gt;
return (0);&lt;br /&gt;
&lt;br /&gt;
}</description>
      <guid isPermaLink="true">http://www.programmersheaven.com/mb/beginnercpp/431450/431450/whole-number-square-roots-only/</guid>
      <pubDate>Sat, 02 Mar 2013 16:17:47 -0700</pubDate>
      <category>Beginner C/C++</category>
    </item>
  </channel>
</rss>